Bloom filter route decoding

ABSTRACT

A route response is received by a mobile apparatus storing a mobile version of a digital map. The route response includes information identifying starting and target locations of a route and a bloom filter encoding a route segment set defined by the route. Decoded starting and target segments for the route are identified from the mobile version of the digital map based on the information identifying the starting and target locations. Map information is accessed for determining a cost value for segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A decoded route from the decoded starting segment to the decoded target segment is determined using a cost minimization route determination algorithm based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle is controlled to traverse the decoded route.

TECHNOLOGICAL FIELD

Example embodiments relate generally to the encoding a route segment setdefined by a route and/or decoding a route from a starting location to atarget location. An example embodiment relates generally to the encodingof a route segment set and/or decoding of a route in a map versionagnostic manner.

BACKGROUND

Generally, a mobile apparatus may submit a route request to a server andthe server may generate the route and provide the route to the mobileapparatus. For example, the mobile apparatus may identify a startingsegment and a target segment based on map information/data of a digitalmap stored by the mobile apparatus and provide the starting segment andthe target segment to the server. The server receives the startingsegment and the target segment, generates a route therebetween based onmap information/data of a digital map stored by the server, and providesa list of segment identifiers to the mobile apparatus, where the segmentidentifiers correspond to the map information/data of the digital mapstored by the server. However, problems can occur when the digital mapstored by the mobile apparatus and the digital map stored by the serverare different versions of the digital map. One solution is for theserver to simply maintain multiple versions of the digital map. However,this solution is not viable for a digital map that updates regularly asthe amount of memory needed to store and maintain all of the multipleversions of the digital map by the server is quite large.

BRIEF SUMMARY OF SOME EXAMPLE EMBODIMENTS

Various embodiments provide for the encoding of a route segment set anddecoding of routes corresponding to the route segment set in a mapversion agnostic manner. As used herein, map version agnosticinformation/data is map information/data that is independent of aparticular version of the digital map. For example, map version agnosticinformation/data is map information/data that is not expected to changebetween a first version of the digital map and a second version of thedigital map. Various embodiments provide for the transmission of anencoded route segment set in a bandwidth efficient manner. In variousembodiments, a route segment set is a set of segments of a route. Forexample, a route is an ordered set of segments and the route segment setis a set consisting of the segments in the ordered set of segments.However, the route segment set may not include any information/dataregarding the ordering of the segments of the route. Various embodimentsprovide for encoding a route segment set using map version agnosticidentifiers that are encoded into a bloom filter, such that the encodedroute segment set may be transmitted as a bit array. In variousembodiments, the encoding may be performed such that the resulting bloomfilter is the smallest bloom filter that is satisfied by route segmentsof the route segment set being encoded (e.g., the members of the bloomfilter are coded map version agnostic identifiers configured to identifythe route segments of the route segment set being encoded) and that isnot satisfied by adjacent segments of the route (e.g., coded map versionagnostic identifiers configured to identify adjacent segments are notmembers of the bloom filter). As used herein, an adjacent segment is asegment that intersections a route, but that is not part of the route.For example, an adjacent segment is associated with an intersection ornode that is also associated with a route segment of the route segmentset. However, the adjacent segment is not a member of the route segmentset.

For example, a mobile apparatus may have a mobile version of a digitalmap stored in a memory of the mobile apparatus. The mobile apparatus mayprovide a route request including information identifying a startinglocation and a target location for a route. The information identifyingthe starting location and target location for the route is map versionagnostic, in various embodiments. For example, the starting location maybe provided as the midpoint and z-level of a mobile version segmentcorresponding to the current location/position of the mobile apparatusand/or a user provided origin. The midpoint of a segment is thecoordinate pair (e.g., latitude and longitude) of the point that isapproximately halfway down the segment, where the ends of the roadsegment are defined by intersections or nodes. For example, the midpointof a segment is a point in the middle of the segment between the twointersections that define the ends of the segment. The z-level of asegment describes the relative location of roads that are stacked. Formost segments, the z-level is 0 (e.g., unstacked and/or on groundlevel), however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive. For example, the targetlocation for the route may be provided as the midpoint and z-level of amobile version segment corresponding to a user provided destination ofthe route and/or a predicted destination of the route.

For example, a network apparatus may have a network version of thedigital map stored in memory of the network apparatus. The networkapparatus may receive the route request provided by the mobile apparatusand identify a network version starting segment corresponding to thestarting location and a network version target segment corresponding tothe target location. The network apparatus may then determine a routefrom the network version starting segment to the network version targetsegment using the network version of the digital map. In variousembodiments, the route may be determined as an ordered list or set ofroute segments to be traversed from the network version starting segmentto the network version target segment. For example, the ordered list orset of route segments may comprise an ordered list of segmentidentifiers that identify the route segments in the network version ofthe digital map. The route segments of the ordered list or set of routesegments define a route segment set.

The network apparatus may then encode the route segment set bydetermining, generating, and/or accessing map version agnosticidentifiers for each of the route segments of the route segment set. Forexample, the map version agnostic identifier for a route segment may bea particular element and/or particular combination of elements of mapversion agnostic map information/data corresponding to the routesegment. In various embodiments, map version agnostic mapinformation/data is map information/data that is not expected to changebetween map versions of the digital map. For example, the map versionagnostic map information/data may include a road name, segment length, adirection of travel of a segment, a functional class of a segment, speedlimit, segment midpoint, and/or the like. The map version agnosticidentifiers for each of the route segments may then be coded and addedto a bloom filter.

A bloom filter is a space-efficient probabilistic data structure that isused to test whether an element is a member of a set. False positivematches are possible, but false negatives are not. In other words, aquery of a bloom filter returns either “possibly in set” or “definitelynot in set.” An empty bloom filter is a bit array of m bits all set to0. One or more coding functions (e.g., k coding functions) are definedand used to map or code a set element to one of the m array positions.For example, to add a set element to the bloom filter, each of the kcoding functions are used to identify k array positions. The kidentified array positions are set to 1. To query the bloom filter totest whether a test element is in the set, the test element is codedusing each of the k coding functions to determine k array positionscorresponding to the test element. If any of the k array positionscorresponding to the test element are 0, the test element is definitelynot in the set. If all of the k array positions corresponding to thetest element are in the set, then it is possible that the test elementis a member of the set encoded by the bloom filter.

In an example embodiment, the network apparatus initiates the bloomfilter with a size that is relatively small (e.g., the number of routesegments in the route segment set) such that the probability of falsepositives is arbitrarily high. The bloom filter may then be tested todetermine if a query of the bloom filter provides a false positive forany of the adjacent segments of the route. If a query of the bloomfilter provides a false positive for any of the adjacent segments, thelarger bloom filter may be generated based on coding the map versionagnostic identifiers of each of the route segments using the k codingfunctions or a different set of coding functions to generate a bloomfilter of m+1 bits. The testing process may be repeated until a query ofthe bloom filter does not return any false positives for the adjacentsegments of the route.

The network apparatus may then provide a route response in response tothe route request comprising the bloom filter such that the mobileapparatus receives the route response. The mobile apparatus may then usethe bloom filter and the mobile version of the digital map to decode theroute. The mobile apparatus may then provide the route (e.g., via a userinterface), control a vehicle such that the vehicle traverses the route,and/or use the route and/or other information/data provided in the routeresponse to perform one or more navigation functions. Some non-limitingexamples of navigation functions include providing a route (e.g., via auser interface), localization, route determination, lane level routedetermination, operating a vehicle along a lane level route, routetravel time determination, lane maintenance, route guidance, lane levelroute guidance, provision of traffic information/data, provision of lanelevel traffic information/data, vehicle trajectory determination and/orguidance, vehicle speed and/or handling control, route and/or maneuvervisualization, and/or the like. Thus, the route, while determined usingthe network version of the digital map may then be decoded using themobile version of the digital map such that differences between thenetwork version and the mobile version of the digital map may betolerated. Additionally, the bandwidth used to provide the routeresponse is minimized by encoding the route segment set using thesmallest bit array that does not provide any false positives for any ofthe adjacent segments of the route.

Various embodiments of the present invention therefore provide technicalsolutions to the technical problems of the bandwidth efficientcommunication of routes between apparatuses that have access todifferent versions of a digital map.

Various embodiments provide for the determining and encoding (e.g., by anetwork apparatus) route segment sets for shortest distance routes,shortest expected travel time routes, multiple way point routes, routeswith additional traffic information/data, routes to points of interest(POIs) identified in a POI search, parking cruise routes, and/or thelike. Various embodiments provide for the decoding and use (e.g., by amobile apparatus) of shortest distance routes, shortest expected traveltime routes, multiple way point routes, routes with additional trafficinformation/data, routes to POIs identified in a POI search, parkingcruise routes, and/or the like.

In an example embodiment, a route response is received. The routeresponse comprises information identifying a starting location and atarget location of a route and a bloom filter encoding a route segmentset defined by the route. The route response was provided by a networkapparatus and is received by a mobile apparatus comprising a processor,a communication interface, and a memory storing a mobile version of adigital map. The information identifying the starting location and thetarget location is used to identify a decoded starting segment of themobile version of the digital map for the route and a decoded targetsegment of the mobile version of the digital map for the route. Mapinformation is accessed for determining a cost value for segments of thedigital map. A segment that satisfies the bloom filter is assigned aminimal cost value. A decoded route from the decoded starting segment tothe decoded target segment is determined based on the cost valueassigned to the segments using a cost minimization route determinationalgorithm. The decoded route is provided via a user interface of themobile apparatus and/or a vehicle associated with the mobile apparatusis controlled (e.g., by the mobile apparatus) such that the vehicletraverses the decoded route.

According to a first aspect, a method is provided. In an exampleembodiment, the method comprises receiving a route response provided bya network apparatus. The route response comprises informationidentifying a starting location and a target location of a route and abloom filter encoding a route segment set defined by the route. Theroute response is received by a mobile apparatus comprising a processor,a communication interface, and a memory storing a mobile version of adigital map. The method further comprises using the informationidentifying the starting location and the target location to identify adecoded starting segment of the mobile version of the digital map forthe route and a decoded target segment of the mobile version of thedigital map for the route. The method further comprises accessing mapinformation for determining a cost value for segments of the digitalmap. A segment that satisfies the bloom filter is assigned a minimalcost value. The method further comprises determining a decoded routefrom the decoded starting segment to the decoded target segment based onthe cost value assigned to the segments using a cost minimization routedetermination algorithm. The method further comprises at least one of(a) providing the decoded route via a user interface of the mobileapparatus or (b) controlling a vehicle such that the vehicle traversesthe decoded route.

In an example embodiment, the cost value assigned to a segment that doesnot satisfy the bloom filter is determined based on at least one of alength of the segment or an expected time to traverse the segment. In anexample embodiment, the cost minimization route determination algorithmis a Dijkstra's algorithm. In an example embodiment, the informationidentifying the starting location and the target location of a routecomprises a geolocation of a point along a network version startingsegment corresponding to an origin of the route and the informationidentifying the target location is a geolocation of a point along anetwork version target segment corresponding to a destination of theroute. In an example embodiment, the method further comprisesdetermining whether the decoded route satisfies at least one qualitymeasure, wherein when the decoded route satisfies the at least onequality measure, the decoded route is provided or used to control thevehicle and when the decoded route does not satisfy the at least onequality measure, a modified route is requested. In an exampleembodiment, determining whether the decoded route satisfies at least onequality measure comprises determining a length of the decoded route; anddetermining whether the length of the decoded route and a route lengthprovided in the route response satisfy a similarity measure, whereinwhen the length of the decoded route and the route length satisfy thesimilarity measure, the decoded route is determined to satisfy the leastone quality measure and when the length of the decoded route and theroute length do not satisfy the similarity measure, the decoded route isdetermined to not satisfy the least one quality measure. In an exampleembodiment, the route response comprises a plurality of bloom filtersand a waypoint list, each of the plurality of bloom filterscorresponding to a leg of the route and the waypoint list providesinformation identifying a beginning segment and an ending segment foreach leg of the route, and determining the decoded route comprisesdetermining a decoded route for each leg, each leg corresponding to oneof the plurality of bloom filters in the order indicated by the waypointlist. In an example embodiment, the method further comprises, prior toreceiving the route response, generating and providing a route request,wherein the route request comprises map version agnostic informationidentifying a starting location for the route and map version agnosticinformation identifying a target location for the route. In an exampleembodiment, the starting location is determined based on locationinformation received from a location sensor in communication with theprocessor.

According to another aspect, an apparatus is provided. In an exampleembodiment, the apparatus comprises at least one processor, acommunications interface configured for communicating via at least onenetwork, and at least one memory storing computer program code and amobile version of a digital map. The at least one memory and thecomputer program code are configured to, with the processor, cause theapparatus to at least receive a route response provided by a networkapparatus, the route response comprising information identifying astarting location and a target location of a route and a bloom filterencoding a route segment set defined by the route; use the informationidentifying the starting location and the target location to identify adecoded starting segment of the mobile version of the digital map forthe route and a decoded target segment of the mobile version of thedigital map for the route; access map information for determining a costvalue for segments of the digital map, wherein a segment that satisfiesthe bloom filter is assigned a minimal cost value; determine a decodedroute from the decoded starting segment to the decoded target segmentbased on the cost value assigned to the segments using a costminimization route determination algorithm; and at least one of (a)provide the decoded route via a user interface of the apparatus or (b)control a vehicle such that the vehicle traverses the decoded route.

In an example embodiment, the cost value assigned to a segment that doesnot satisfy the bloom filter is determined based on at least one of alength of the segment or an expected time to traverse the segment. In anexample embodiment, the cost minimization route determination algorithmis a Dijkstra's algorithm. In an example embodiment, the informationidentifying the starting location and the target location of a routecomprises a geolocation of a point along a network version startingsegment corresponding to an origin of the route and the informationidentifying the target location is a geolocation of a point along anetwork version target segment corresponding to a destination of theroute. In an example embodiment, the at least one memory and thecomputer program code are further configured to, with the processor,cause the apparatus to at least determine whether the decoded routesatisfies at least one quality measure, wherein when the decoded routesatisfies the at least one quality measure, the decoded route isprovided or used to control the vehicle and when the decoded route doesnot satisfy the at least one quality measure, a modified route isrequested. In an example embodiment, determining whether the decodedroute satisfies at least one quality measure comprises determining alength of the decoded route; and determining whether the length of thedecoded route and a route length provided in the route response satisfya similarity measure, wherein when the length of the decoded route andthe route length satisfy the similarity measure, the decoded route isdetermined to satisfy the least one quality measure and when the lengthof the decoded route and the route length do not satisfy the similaritymeasure, the decoded route is determined to not satisfy the least onequality measure. In an example embodiment, the route response comprisesa plurality of bloom filters and a waypoint list, each of the pluralityof bloom filters corresponding to a leg of the route and the waypointlist provides information identifying a beginning segment and an endingsegment for each leg of the route, and determining the decoded routecomprises determining a decoded route for each leg, each legcorresponding to one of the plurality of bloom filters in the orderindicated by the waypoint list. In an example embodiment, the at leastone memory and the computer program code are further configured to, withthe processor, cause the apparatus to at least, prior to receiving theroute response, generate and provide a route request, wherein the routerequest comprises map version agnostic information identifying astarting location for the route and map version agnostic informationidentifying a target location for the route. In an example embodiment,the starting location is determined based on location informationreceived from a location sensor in communication with the processor.

According to yet another aspect, a computer program product is provided.In an example embodiment, the computer program product comprises atleast one non-transitory computer-readable storage medium havingcomputer-readable program code portions stored therein. Thecomputer-readable program code portions comprise executable portionsconfigured, when executed by a processor of an apparatus, to cause theapparatus to receive a route response provided by a network apparatus,the route response comprising information identifying a startinglocation and a target location of a route and a bloom filter encoding aroute segment set defined by the route; use the information identifyingthe starting location and the target location to identify a decodedstarting segment of the mobile version of the digital map for the routeand a decoded target segment of the mobile version of the digital mapfor the route; access map information for determining a cost value forsegments of the digital map, wherein a segment that satisfies the bloomfilter is assigned a minimal cost value; determine a decoded route fromthe decoded starting segment to the decoded target segment based on thecost value assigned to the segments using a cost minimization routedetermination algorithm; and at least one of (a) provide the decodedroute via a user interface of the apparatus or (b) control a vehiclesuch that the vehicle traverses the decoded route.

In an example embodiment, the cost value assigned to a segment that doesnot satisfy the bloom filter is determined based on at least one of alength of the segment or an expected time to traverse the segment. In anexample embodiment, the cost minimization route determination algorithmis a Dijkstra's algorithm. In an example embodiment, the informationidentifying the starting location and the target location of a routecomprises a geolocation of a point along a network version startingsegment corresponding to an origin of the route and the informationidentifying the target location is a geolocation of a point along anetwork version target segment corresponding to a destination of theroute. In an example embodiment, the computer-readable program codeportions further comprise executable portions configured, when executedby a processor of an apparatus, to cause the apparatus to determinewhether the decoded route satisfies at least one quality measure,wherein when the decoded route satisfies the at least one qualitymeasure, the decoded route is provided or used to control the vehicleand when the decoded route does not satisfy the at least one qualitymeasure, a modified route is requested. In an example embodiment,determining whether the decoded route satisfies at least one qualitymeasure comprises determining a length of the decoded route; anddetermining whether the length of the decoded route and a route lengthprovided in the route response satisfy a similarity measure, whereinwhen the length of the decoded route and the route length satisfy thesimilarity measure, the decoded route is determined to satisfy the leastone quality measure and when the length of the decoded route and theroute length do not satisfy the similarity measure, the decoded route isdetermined to not satisfy the least one quality measure. In an exampleembodiment, the route response comprises a plurality of bloom filtersand a waypoint list, each of the plurality of bloom filterscorresponding to a leg of the route and the waypoint list providesinformation identifying a beginning segment and an ending segment foreach leg of the route, and determining the decoded route comprisesdetermining a decoded route for each leg, each leg corresponding to oneof the plurality of bloom filters in the order indicated by the waypointlist. In an example embodiment, the computer-readable program codeportions further comprise executable portions configured, when executedby a processor of an apparatus, to cause the apparatus to, prior toreceiving the route response, generate and provide a route request,wherein the route request comprises map version agnostic informationidentifying a starting location for the route and map version agnosticinformation identifying a target location for the route. In an exampleembodiment, the starting location is determined based on locationinformation received from a location sensor in communication with theprocessor.

According to a still another aspect, an apparatus is provided. In anexample embodiment, the apparatus comprises means for receiving a routeresponse provided by a network apparatus. The route response comprisesinformation identifying a starting location and a target location of aroute and a bloom filter encoding a route segment set defined by theroute. The apparatus comprises means for using the informationidentifying the starting location and the target location to identify adecoded starting segment of the mobile version of the digital map forthe route and a decoded target segment of the mobile version of thedigital map for the route. The apparatus comprises means for accessingmap information for determining a cost value for segments of the digitalmap. A segment that satisfies the bloom filter is assigned a minimalcost value. The apparatus comprises means for determining a decodedroute from the decoded starting segment to the decoded target segmentbased on the cost value assigned to the segments using a costminimization route determination algorithm. The apparatus comprisesmeans for at least one of (a) providing the decoded route via a userinterface of the mobile apparatus or (b) controlling a vehicle such thatthe vehicle traverses the decoded route.

BRIEF DESCRIPTION OF THE DRAWINGS

Having thus described certain example embodiments in general terms,reference will hereinafter be made to the accompanying drawings, whichare not necessarily drawn to scale, and wherein:

FIG. 1 is a block diagram showing an example architecture of oneembodiment of the present invention;

FIG. 2A is a block diagram of a network apparatus that may bespecifically configured in accordance with an example embodiment;

FIG. 2B is a block diagram of a mobile apparatus that may bespecifically configured in accordance with an example embodiment;

FIG. 3 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to provide a route response, in accordancewith an example embodiment;

FIG. 4 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to produce a bloom filter, in accordancewith an example embodiment;

FIG. 5 is a flowchart illustrating operations performed, such as by themobile apparatus of FIG. 2B to decode a route based on a route segmentset encoded by a bloom filter, in accordance with an example embodiment;

FIG. 6A illustrates an example route, in accordance with an exampleembodiment;

FIG. 6B illustrates a process performed to generate a decoded routebased on a bloom filter encoding a route segment set defined by theroute shown in FIG. 6A, in accordance with an example embodiment;

FIG. 7 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to provide a multiple stop route response,in accordance with an example embodiment;

FIG. 8 is a flowchart illustrating operations performed, such as by themobile apparatus of FIG. 2B to decode legs of a multiple stop routebased on a received multiple stop route response, in accordance with anexample embodiment;

FIG. 9 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to provide a route response includingadditional traffic information/data, in accordance with an exampleembodiment;

FIG. 10 is a flowchart illustrating operations performed, such as by themobile apparatus of FIG. 2B to decode and use additional trafficinformation/data, in accordance with an example embodiment;

FIG. 11 is an example interactive user interface (IUI) of a userinterface of a mobile apparatus of FIG. 2B providing a route andcorresponding additional traffic information/data, in accordance with anexample embodiment;

FIG. 12 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to provide a POI route response, inaccordance with an example embodiment;

FIG. 13 is a flowchart illustrating operations performed, such as by themobile apparatus of FIG. 2B to provide a user with a results of a POIsearch, in accordance with an example embodiment;

FIG. 14 is an example POI search result IUI of a user interface of amobile apparatus of FIG. 2B providing results of a POI search, inaccordance with an example embodiment;

FIG. 15 is a flowchart illustrating operations performed, such as by thenetwork apparatus of FIG. 2A to provide a parking cruise route response,in accordance with an example embodiment; and

FIG. 16 is a flowchart illustrating operations performed, such as by themobile apparatus of FIG. 2B to decode and use a parking cruise route, inaccordance with an example embodiment.

DETAILED DESCRIPTION OF SOME EXAMPLE EMBODIMENTS

Some embodiments will now be described more fully hereinafter withreference to the accompanying drawings, in which some, but not all,embodiments of the invention are shown. Indeed, various embodiments ofthe invention may be embodied in many different forms and should not beconstrued as limited to the embodiments set forth herein; rather, theseembodiments are provided so that this disclosure will satisfy applicablelegal requirements. The term “or” (also denoted “/”) is used herein inboth the alternative and conjunctive sense, unless otherwise indicated.The terms “illustrative” and “exemplary” are used to be examples with noindication of quality level. Like reference numerals refer to likeelements throughout. As used herein, the terms “data,” “content,”“information,” and similar terms may be used interchangeably to refer todata capable of being transmitted, received and/or stored in accordancewith embodiments of the present invention. As used herein, the terms“substantially” and “approximately” refer to values that are withinmanufacturing and/or engineering guidelines and/or limits. Thus, use ofany such terms should not be taken to limit the spirit and scope ofembodiments of the present invention.

Additionally, as used herein, the term ‘circuitry’ refers to (a)hardware-only circuit implementations (e.g., implementations in analogcircuitry and/or digital circuitry); (b) combinations of circuits andcomputer program product(s) comprising software and/or firmwareinstructions stored on one or more computer readable memories that worktogether to cause an apparatus to perform one or more functionsdescribed herein; and (c) circuits, such as, for example, amicroprocessor(s) or a portion of a microprocessor(s), that requiresoftware or firmware for operation even if the software or firmware isnot physically present. This definition of ‘circuitry’ applies to alluses of this term herein, including in any claims. As a further example,as used herein, the term ‘circuitry’ also includes an implementationcomprising one or more processors and/or portion(s) thereof andaccompanying software and/or firmware.

I. General Overview

Methods, apparatus, and computer program products are provided inaccordance with various embodiments in order to provide a route segmentset encoded in a map version agnostic manner, provide (e.g., transmit)an encoded route segment set in a bandwidth efficient manner, and togenerate and use a decoded route based on a route segment set that wasencoded in a map version agnostic manner. For example, variousembodiments provide for encoding a route segment set using map versionagnostic identifiers configured to identify the route segments that makeup the route that are encoded into a bloom filter, such that the encodedroute segment set may be transmitted as a bit array. In variousembodiments, the encoding may be performed such that the resulting bloomfilter is the smallest bloom filter that is satisfied by route segmentsof the route (e.g., the members of the route segment set being encodedsuch that the members of the bloom filter are coded map version agnosticidentifiers of the route segments of the route segment set) and that isnot satisfied by adjacent segments of the route (e.g., coded map versionagnostic identifiers of adjacent segments are not members of the bloomfilter). As used herein, an adjacent segment is a segment thatintersects a route, but that is not part of the route.

For example, a mobile apparatus may have a mobile version of a digitalmap stored in memory of the mobile apparatus. The mobile apparatus mayprovide a route request including information identifying a startinglocation and a target location for a route. The information identifyingthe starting location and target location for the route is map versionagnostic, in various embodiments. For example, the starting location maybe provided as the midpoint and z-level of a mobile version startingsegment corresponding to the current location/position of the mobileapparatus and/or a user provided location. The midpoint of a segment isthe coordinate pair (e.g., latitude and longitude) of the point that isapproximately halfway down the segment, where the ends of the roadsegment are defined by intersections or nodes. For example, the midpointof a segment is a point in the middle of the segment between the twointersections that define the ends of the segment. The z-level of asegment describes the relative location of roads that are stacked. Formost segments, the z-level is 0 (e.g., unstacked and/or on groundlevel), however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive. For example, the targetlocation for the route may be provided as the midpoint and z-level of amobile version target segment corresponding to a user provideddestination of the route and/or a predicted destination of the route.

For example, a network apparatus may have a network version of thedigital map stored in memory of the network apparatus. In varioussituations, the mobile version and the network version may be differentversions of the digital map. The network apparatus may receive the routerequest provided by the mobile apparatus and identify a network versionstarting segment corresponding to the starting location and a networkversion target segment corresponding to the target location. The networkapparatus may then determine a route from the network version startingsegment to the network version target segment using the network versionof the digital map. In various embodiments, the network apparatus maydetermine the route using a best-first algorithm (e.g., Dijkstra'salgorithm and/or a modified Dijkstra's algorithm) or another routedetermination algorithm. In various embodiments, the route determinationalgorithm is configured to determine a lowest cost route. In variousembodiments, the route may be determined as an ordered list or set ofroute segments of the network version of the digital map to be traversedfrom the network version starting segment to the network version targetsegment. For example, the ordered list or set of route segments maycomprise an ordered list of segment identifiers that identify the routesegments in the network version of the digital map. The route segmentsof the ordered list or set of route segments define a route segment set.For example, the route segment set is a set having as members only theroute segments of the ordered list or set of route segments.

The network apparatus may then encode the route segment set bydetermining, generating, and/or accessing map version agnosticidentifiers for each of the route segments of the route segment set. Forexample, the map version agnostic identifier for a segment may be aparticular element and/or particular combination of elements of mapversion agnostic map information/data corresponding to the segment. Invarious embodiments, map version agnostic map information/data is mapinformation/data that is not expected to change between map versions ofthe digital map. For example, the map version agnostic mapinformation/data may include a road name, segment length, a direction oftravel of a segment, a functional class of a segment, speed limit,segment midpoint, and/or the like. A set S is defined that consists of amap version agnostic identifier for each of the route segments of theroute segment set. For example, the number of elements in the set S isequal to the number of route segments of the route. Each element of theset S (e.g., the map version agnostic identifiers for each of the routesegments) may then be coded using one or more coding functions and addedto a bloom filter. The bloom filter may then be used to test one or morecoded map version agnostic identifiers to determine if it is possiblefor the one or more map version agnostic identifiers to be elements ofthe set S. For example, the bloom filter may be used to test whether oneor more segments are route segments of the route (if a segment may be amember of the route segment set).

In general, a bloom filter is a space-efficient probabilistic datastructure that is used to test whether an element is a member of a set.False positive matches are possible, but false negatives are not. Inother words, a query of a bloom filter returns either “possibly in set”or “definitely not in set.” An empty bloom filter is a bit array of mbits all set to 0. One or more coding functions (e.g., k codingfunctions) are defined and used to map or code a set element to one ofthe m array positions. For example, to add a set element to the bloomfilter, each of the k coding functions are used to identify k arraypositions. The k identified array positions are set to 1. To query thebloom filter to test whether a test element is in the set, the testelement is coded using each of the k coding functions to determine karray positions corresponding to the test element. If any of the k arraypositions corresponding to the test element are 0, the test element doesnot satisfy the bloom filter and test element is definitely not in theset. If all of the k array positions corresponding to the test elementare in the set, then the test element satisfies the bloom filter and itis possible that the test element is a member of the set encoded to bythe bloom filter.

In an example embodiment, the network apparatus initiates the bloomfilter with a size m that is relatively small (e.g., the number of routesegments in the route segment set or the number of elements in the setS) such that the probability of false positives is arbitrarily high. Thebloom filter may then be tested to determine if a query of the bloomfilter provides a false positive for any of the adjacent segments of theroute. For example, the adjacent segments of the route may bedetermined, a map version agnostic identifier corresponding to eachadjacent segment of the route may be determined, and a set T may bedefined that consists of the map version agnostic identifierscorresponding to the adjacent segments of the route. As the set Tconsists of map version agnostic identifiers of adjacent segments andthe set S consists of map version agnostic identifiers of routesegments, there is no overlap in the membership of set T and set S(e.g., S∩T=0). The bloom filter may then be tested to see if, when codedusing the one or more coding functions, any elements of the set Treceive false positives for being elements of the set S. If a query ofthe bloom filter provides a false positive for any of the adjacentsegments (e.g., a coded map version agnostic identifier from set T isfound to possibly be a member of set S), a larger bloom filter may begenerated based on coding the map version agnostic identifiers of eachof the route segments using the k coding functions or a different set ofcoding functions to generate a bloom filter of m+1 bits. The testingprocess may be repeated until a query of the bloom filter does notreturn any false positives for the adjacent segments of the route.

The network apparatus may then provide a route response in responsecomprising the bloom filter such that the mobile apparatus receives theroute response. In various embodiments, the mobile apparatus may thenuse the bloom filter and the mobile version of the digital map to decodethe route. In an example embodiment, the mobile apparatus may use thebloom filter to assign cost values to one or more segments of the mobileversion of the digital map. For example, if a first segment identifiedby a first map version agnostic identifier is found to possibly be amember of the set S (e.g., the coded first map version agnosticidentifier satisfies the bloom filter), the cost value assigned to thefirst segment is a minimal cost value (e.g., zero and/or a smaller costvalue than the cost value assigned to the segments that are found to notbe members of the set S). If the first segment is found to definitelynot be a member of the set S, (e.g., the coded first map versionagnostic identifier does not satisfy the bloom filter), the firstsegment is assigned a cost value based on map information/datacorresponding to the first segment (e.g., a length of the first segment,an expected traversal time for the first segment which may be determinedbased on current or historical traffic information/data, a traffic levelindicator for the first segment, and/or the like). The mobile apparatusmay then use the determined and/or assigned cost values to decode theroute using a best-first algorithm (e.g., Dijkstra's algorithm and/or amodified version of Dijkstra's algorithm) or another cost minimizationalgorithm based on the mobile version of the digital map.

The mobile apparatus may then provide the route (e.g., via a userinterface), control a vehicle such that the vehicle traverses the route,and/or use the route and/or other information/data provided in the routeresponse to perform one or more navigation functions. Some non-limitingexamples of navigation functions include localization, routedetermination, lane level route determination, operating a vehicle alonga lane level route, route travel time determination, lane maintenance,route guidance, lane level route guidance, provision of trafficinformation/data, provision of lane level traffic information/data,vehicle trajectory determination and/or guidance, vehicle speed and/orhandling control, route and/or maneuver visualization, and/or the like.

Thus, the route, while determined using the network version of thedigital map may then be decoded using the mobile version of the digitalmap such that differences between the network version and the mobileversion of the digital map may be tolerated. Additionally, the bandwidthused to provide the route response is minimized by encoding the routesegment set defined by the route using the smallest bit array that doesnot provide any false positives for any of the adjacent segments of theroute.

Various embodiments provide for the determining and encoding (e.g., by anetwork apparatus) route segment sets for shortest distance routes,shortest expected travel time routes, multiple way point routes, routeswith additional traffic information/data, routes to points of interest(POIs) identified in a POI search, parking cruise routes, and/or thelike. Various embodiments provide for the decoding and use (e.g., by amobile apparatus) of shortest distance routes, shortest expected traveltime routes, multiple way point routes, routes with additional trafficinformation/data, routes to POIs identified in a POI search, parkingcruise routes, and/or the like.

FIG. 1 provides an illustration of an example system that can be used inconjunction with various embodiments of the present invention. As shownin FIG. 1, the system may include one or more network apparatuses 10,one or more mobile apparatuses 20, one or more networks 50, and/or thelike. In various embodiments, a mobile apparatus 20 may be onboard avehicle 5. In various embodiments, the mobile apparatus 20 may be an invehicle navigation system, vehicle control system, a mobile computingdevice, a mobile data gathering platform, and/or the like. For example,a mobile apparatus 20 may be an in vehicle navigation system mountedwithin and/or be onboard a vehicle 5 such as a motor vehicle, non-motorvehicle, automobile, car, scooter, truck, van, bus, motorcycle, bicycle,Segway, golf cart, and/or the like. In an example embodiment, the mobileapparatus 20 may be a vehicle control system configured to autonomouslydrive a vehicle 5, assist in control of a vehicle 5, monitor variousaspects of the vehicle 5 (e.g., fault conditions, motor oil status,battery charge level, fuel tank fill level, and/or the like) and/or thelike. In various embodiments, the mobile apparatus 20 is configured toautonomously drive a vehicle 5 may perform multiple functions that aresimilar to those performed by a mobile apparatus 20 configured to be anADAS (e.g., lane keeping, lane change assistance, maintaining a lane,merging, etc.). In some embodiments, a mobile apparatus 20 may beonboard a personal vehicle, commercial vehicle, public transportationvehicle, fleet vehicle, and/or other vehicle. In various embodiments,the mobile apparatus 20 may be a smartphone, tablet, personal digitalassistant (PDA), personal computer, desktop computer, laptop, and/orother mobile computing device. In an example embodiment, a mobileapparatus 20 is onboard a vehicle 5 and is used to perform one or morenavigation functions corresponding to the vehicle 5 traversing at leasta portion of a road network. In an example embodiment, the networkapparatus 10 is a server, group of servers, distributed computingsystem, and/or other computing system. In an example embodiment, thenetwork apparatus 10 is not located onboard a vehicle. For example, thenetwork apparatus 10 may be in communication with one or more mobileapparatuses 20 and/or the like via one or more wired or wirelessnetworks 50.

In an example embodiment, a network apparatus 10 may comprise componentssimilar to those shown in the example network apparatus 10 diagrammed inFIG. 2A. In an example embodiment, the network apparatus 10 isconfigured to receive route requests generated and provided by one ormore mobile apparatuses 20, determine a route based on the route requestand possibly additional information/data (e.g., traffic information/dataalong the route or along segments near the route (e.g., adjacentsegments and/or the like), POI information/data, and/or the like),encode the route segment set defined by the route using a bloom filter,and provide a route response including the bloom filter such that themobile apparatus 20 receives the route response, and/or the like. Forexample, as shown in FIG. 2A, the network apparatus 10 may comprise aprocessor 12, memory 14, a user interface 18, a communications interface16, and/or other components configured to perform various operations,procedures, functions or the like described herein. In variousembodiments, the network apparatus 10 stores a network version of adigital map (e.g., in memory 14). In at least some example embodiments,the memory 14 is non-transitory.

In an example embodiment, a mobile apparatus 20 is a mobile computingentity. For example, in various embodiments, a mobile apparatus 20 isonboard a vehicle 5. In an example embodiment, the mobile apparatus 20may be configured to determine a current location of the mobileapparatus and/or receive user input indicating an origin of a route,receive user input indicating a destination of a route and/or predict adestination, generate and provide a route request, receive a routeresponse, generate a decode route based on a route segment set encodedby a bloom filter and provided as part of the route request, and providethe decoded route to a user and/or to use the decoded route to controlthe vehicle to traverse the decoded route from the origin to thedestination. In an example embodiment, the mobile apparatus 20 isconfigured to determine location information/data indicating a location(e.g., geolocation such as latitude and longitude and/or the like) ofthe vehicle 5 and/or mobile apparatus 20.

In an example embodiment, as shown in FIG. 2B, the mobile apparatus 20may comprise a processor 22, memory 24, a communications interface 26, auser interface 28, one or more sensors 29 (e.g., a location sensor suchas a GNSS sensor; IMU sensors; camera(s); image sensors; two dimensional(2D) and/or three dimensional (3D) light detection and ranging(LiDAR)(s); long, medium, and/or short range radio detection and ranging(RADAR); ultrasonic sensors; electromagnetic sensors; (near-) infrared(IR) cameras; 3D cameras; 360° cameras; fuel level sensors; vehiclesystem sensors (e.g., oil status sensors, tire pressure sensors, engineoil pressure sensors, coolant level sensors, engine/coolant temperaturesensors, and/or other sensors that enable the mobile apparatus 20 todetermine the location of the mobile apparatus 20 and/or one or morefeatures of the corresponding vehicle's 5 surroundings and/or monitorthe vehicle's 5 operating parameters), and/or other componentsconfigured to perform various operations, procedures, functions or thelike described herein. In various embodiments, the mobile apparatus 20stores a mobile version of a digital map (e.g., in memory 24). In atleast some example embodiments, the memory 24 is non-transitory.

Each of the components of the system may be in electronic communicationwith, for example, one another over the same or different wireless orwired networks 50 including, for example, a wired or wireless PersonalArea Network (PAN), Local Area Network (LAN), Metropolitan Area Network(MAN), Wide Area Network (WAN), cellular network, and/or the like. Insome embodiments, a network 50 may comprise the automotive cloud,digital transportation infrastructure (DTI), radio data system(RDS)/high definition (HD) radio or other digital radio system, and/orthe like. For example, a mobile apparatus 20 may be in communicationwith a network apparatus 10 via the network 50. For example, a mobileapparatus 20 may communicate with the network apparatus 10 via anetwork, such as the Cloud. For example, the Cloud may be a computernetwork that provides shared computer processing resources and data tocomputers and other devices connected thereto. For example, the mobileapparatus 20 may be configured to provide one or more route requests viathe network 50. For example, the network apparatus 10 may be configuredto receive one or more route requests and provide corresponding routeresponses via the network 50. For example, a mobile apparatus 20 may beconfigured to receive a route response via the network 50.

Certain example embodiments of the network apparatus 10 and/or probeapparatus 20 are described in more detail below with respect to FIGS. 2Aand 2B.

II. Example Operation

Methods, apparatus, and computer program products are provided inaccordance with various embodiments in order to provide a route segmentset encoded in a map version agnostic manner, provide (e.g., transmit)an encoded route segment set in a bandwidth efficient manner, and togenerate a decoded route and use the decoded route, wherein the decodedroute was generated based on a route segment set that was encoded in amap version agnostic manner. For example, a mobile apparatus may store amobile version of a digital map and a network apparatus may store anetwork version of a digital map. The mobile version and the networkversion of the digital map may be the same version or different versionsof the digital map. Thus, the route must be provided in a manner that,if the network version is a different version of the digital map thanthe mobile version, the mobile apparatus can still decode and use theroute. Segment identifiers that identify segments (e.g., traversable mapelements (TMEs)) of the digital map may change between differentversions of the map. Thus, providing the route simply as a list ofsegment identifiers (or an encoded set of segment identifiers)determined based on the network version of the digital map may result inproblems when the mobile apparatus attempts to decode the route usingthe mobile version of the digital map. Moreover, the network 50 may be abandwidth limited network and/or the mobile apparatus 20 may havelimited connectivity to the network 50 as the mobile apparatus 20 movesaround. Thus, the size of the payload of the route response may beminimized and/or maintained at a reasonable size, in variousembodiments.

Various embodiments provide for encoding a route segment set using mapversion agnostic identifiers configured to identify the route segmentsof the route segment set defined by the route, such that the encodedroute segment set may be transmitted as a bit array. In variousembodiments, the encoding may be performed such that the resulting bloomfilter is the smallest bloom filter that is satisfied by route segmentsof the route segment set being encoded (e.g., the members of the bloomfilter are coded map version agnostic identifiers of the segments of theroute determined in response to the route request) and that is notsatisfied by adjacent segments of the route (e.g., coded map versionagnostic identifiers of adjacent segments are not members of the bloomfilter and therefore are not members of the route segment set). Variousembodiments provide for the determining and encoding (e.g., by a networkapparatus) route segment sets for shortest distance routes, shortestexpected travel time routes, multiple way point routes, routes withadditional traffic information/data, routes to points of interest (POIs)identified in a POI search, parking cruise routes, and/or the like.Various embodiments provide for the decoding and use (e.g., by a mobileapparatus) route segments sets for shortest distance routes, shortestexpected travel time routes, multiple way point routes, routes withadditional traffic information/data, routes to POIs identified in a POIsearch, parking cruise routes, and/or the like.

A. Shortest Distance and Shortest Expected Travel Time Routes

In various embodiments, a shortest distance route, a shortest expectedtravel time route, or various other types of routes (e.g., a tollavoided route, highway avoided route, and/or the like) may be generated.For example, a mobile apparatus 20 may generate (e.g., possibly based onuser input received via the user interface 28) and provide a routerequest for a shortest distance route or shortest expected travel timeroute from a starting location to a target location. The networkapparatus 10 may receive the route request, determine a route based onthe route request, encode a route segment set defined by the route usinga bloom filter and map version agnostic identifiers configured toidentify the route segments of the route, and provide a route responsecomprising the bloom filter encoding the route segment set correspondingto the route. The mobile apparatus 20 may receive the route responsecomprising the bloom filter, generate a decoded route based on the bloomfilter, and provide the decoded route and/or control a vehicle 5 suchthat the vehicle traverses the decoded route.

i. Exemplary Operation of a Network Apparatus

FIG. 3 provides a flowchart illustrating operations performed, such asby the network apparatus 10 to provide a route response, in accordancewith an example embodiment. Starting at block 302, a route request isreceived. For example, the network apparatus 10 may receive a routerequest. For example, the network apparatus 10 may comprise means, suchas processor 12, memory 14, communications interface 16, and/or the likefor receiving a route request. In various embodiments, the route requestmay comprise a mobile apparatus identifier identifying the mobileapparatus that provided the route request, map version agnosticinformation/data identifying a starting location, map version agnosticinformation/data identifying a target location, one or more parametersfor the route (e.g., shortest distance, shortest expected travel time,avoid tolls, avoid highways, driving route, biking route, walking route,and/or the like), and/or the like. In various embodiments, theinformation/data identifying the starting location and the targetlocation are independent of a version of the digital map. In an exampleembodiment, the information/data identifying the starting location isprovided as the midpoint and z-level of a mobile version segmentcorresponding to the current location/position of the mobile apparatusand/or a user provided origin for the route. The midpoint of a segmentis the coordinate pair (e.g., latitude and longitude) of the point thatis approximately halfway down the segment, where the ends of the roadsegment are defined by intersections or nodes. For example, the midpointof a segment is a point in the middle of the segment between the twointersections that define the ends of the segment. The z-level of asegment describes the relative location of roads that are stacked. Formost segments, the z-level is 0 (e.g., unstacked and/or on groundlevel); however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version segmentcorresponding to a user provided and/or selected destination of theroute and/or a predicted destination of the route.

At block 304, the start segment and target segment of the networkversion of the digital map are identified. For example, the networkapparatus 10 may identify the start segment and the target segment ofthe network version of the digital map. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for identifying the start segment and identifying the targetsegment of the network version of the digital map. For example, theinformation/data identifying the starting location may be map-matched(e.g., using a map matching algorithm, engine, and/or the like) based onthe network version of the digital map to identify the starting segmentof the network version of the digital map. For example, theinformation/data identifying the target location may be map-matched(e.g., using a map matching algorithm, engine, and/or the like) based onthe network version of the digital map to identify the target segment ofthe network version of the digital map. In various embodiments, theinformation/data identifying the starting segment and/or target segmentmay be map-matched to the network version of the digital map such thatan error up to a preset error in the matching of the midpointcorresponding to the starting/target location to the midpoint of thecorresponding segment of the network version of the digital map. Thestarting segment of the network version of the digital map is alsoreferred to as the network version starting segment herein. Similarly,the target segment of the network version of the digital map is alsoreferred to as the network version target segment herein. The z-levelcorresponding to the starting location and/or the target location may beused for tie breaking in the case where the starting location and/ortarget location corresponds to a tunnel, bridge, stacked roads, and/orthe like. If the network apparatus cannot exactly match (e.g., withinthe preset error) a start segment and/or target segment of the networkversion of the digital map to the information/data identifying the startand/or target location, the route response may include a flag indicatingsuch.

At block 306, a route is determined from the starting segment to thetarget segment. For example, the network apparatus 10 may determine anavigable route from the starting segment to the target segment usingthe network version of the digital map. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for determining a navigable route from the starting segment tothe target segment using the network version of the digital map. Avariety of route determining algorithms may be used in variousembodiments. In various embodiments, a route determining algorithm thatuses cost values is used to determine the route. For example, abest-first algorithm may be used to determine a route from the startingsegment to the target segment. For example, a modified Dijkstra'salgorithm may be used to determine the route from the starting segmentto the target segment. In an example embodiment, the route may bedesignated as an ordered list or set of route segments. For example, todetermine the route, an ordered list or set of route segments (and/orsegment identifiers of the network version of the digital mapidentifying the route segments) may be generated. The route segments ofthe ordered list or set of route segments define a route segment set(e.g., a set including only the route segments of the route but that maynot include the order information/data of the ordered list or set ofroute segments).

In an example embodiment, the cost value assigned to a segment may bethe length of the segment, the expected time to traverse the segment, atraffic level indicator, and/or the like. For example, if the routerequest indicated a parameter corresponding to a shortest distanceroute, the cost value assigned to each segment is the length of thesegment. In an example embodiment, the length of a segment is determinedbased on a segment record stored in a geographic database storing themap information/data of the network version of the digital map. Inanother example, if the route request indicated a parametercorresponding to a shortest expected travel time route, the cost valueassigned to each segment is the expected traversal time of the segment.In an example embodiment, the expected traversal time of a segment isdetermined based on a length of the segment and an expected travel speedalong the segment. In an example embodiment, the length of the segmentis determined based on a segment record stored in a geographic databasestoring the map information/data of the network version of the digitalmap. In an example embodiment, the expected travel speed along thesegment is determined based on current traffic information/data and/orhistorical traffic information/data corresponding to the segment. In anexample embodiment, the current traffic information/data may bedetermined based on probe information/data corresponding to the segmentand/or a traffic report provided by a traffic management office. In anexample embodiment, the historical traffic information/data may bestored in association with an epoch or time period of a day, week,month, year, and/or the like in the segment record corresponding to thesegment and stored in the geographic database storing the mapinformation/data of the network version of the digital map. In stillanother example, the cost value assigned to each segment may be atraffic level indicator determined based on current and/or historicaltraffic information/data. For example, the cost value assigned to asegment could be the inverse of the free flow ratio for the segmentbased on current and/or historical traffic information/data. In anexample embodiment, the free flow ratio along a segment is the ratio ofa travel speed along the segment (e.g., as determined based on currentand/or historical traffic information/data) divided by a free flow speedfor the segment.

At block 308, a bloom filter encoding the route segment set defined bythe route from the starting segment to the target segment is produced.For example, the network apparatus 10 may produce a bloom filterencoding the route segment set defined by the route from the startingsegment to the target segment. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, and/or the like, forproducing a bloom filter encoding the route segment set defined by theroute from the starting segment to the target segment. For example, mapinformation/data corresponding to the route segments may be accessedfrom the geographic database. One or more map version agnostic elementsof the map information/data corresponding to a route segment may be usedto generate a map version agnostic identifier for the route segment. Invarious embodiments, the one or more map version agnostic elements ofthe map information/data and the order in which map version agnosticelements are combined to generate the map version agnostic identifier ispre-established and/or defined. For example, the mobile apparatus 20 andthe network apparatus 10 are both configured to generate map versionagnostic identifiers in the same pre-established and/or defined way(e.g., using the same elements of map information/data combined in thesame order). For example, the map version agnostic identifier may begenerated using a map version agnostic identifier algorithm and themobile apparatus 20 and the network apparatus 10 may use the same mapversion agnostic identifier algorithm. The set of the map versionagnostic identifiers identifying the route segments of the route segmentset in a map version agnostic manner are then coded using one or morecoding functions and added to a bloom filter. In an example embodiment,the one or more coding functions include one or more hashing functions.For example, the one or more coding functions may include adeterministic hashing function such as a secure hash algorithm (SHA),MD5 message-digest algorithm, and/or the like. Thus, a bloom filter maybe produced that encodes the map version agnostic identifiers of each ofthe route segments of the route.

At block 310, a route response is generated and provided such that themobile apparatus 20 receives the route response. For example, thenetwork apparatus 10 may generate and provide a route response such thatthe mobile apparatus 20 receives the route response. For example, thenetwork apparatus 10 may comprise means, such as processor 12, memory14, communication interface 16, and/or the like for generating andproviding (e.g., transmitting) a route response such that the mobileapparatus 20 receives the route response. In various embodiments, theroute response comprises the bloom filter (e.g., as a bit array). In anexample embodiment, the route response comprises information/dataidentifying a network version starting location and information/dataidentifying a network version target location. In various embodiments,the information/data identifying the network version starting locationand network version target location is map version agnostic. Forexample, in an example embodiment, the information/data identifying thenetwork version starting location is the midpoint of (or other pointalong) the network version starting segment and the z-level of thenetwork version starting segment, and the information/data identifyingthe network version target segment is the midpoint of (or other pointalong) the network version target segment and the z-level of the networkversion target segment. In an example embodiment, generating the routeresponse includes determining a length of the route. For example, thelength of each route segment may be summed to determine a length of theroute. The length of the route may then be included in the routeresponse, in an example embodiment.

ii. Producing a Bloom Filter Encoding a Route

As noted above, the network apparatus 10 produces a bloom filterencoding the route segment set defined by the route and provides thebloom filter such that the mobile apparatus 20 receives the bloom filterfor use in decoding the route (e.g., determining or generating a decodedroute). FIG. 4 provides a flowchart illustrating operations performed,such as by the network apparatus 10 to produce a bloom filter, inaccordance with an example embodiment.

Starting at block 402, after a route comprising one or more routesegments is determined from the starting segment to the target segment(e.g., a route segment set is defined), map version agnosticinformation/data for each of the route segments is accessed. Forexample, the network apparatus 10 may access map version agnosticinformation/data for each of the route segments. For example, thenetwork apparatus 10 may comprise means, such as processor 12, memory14, and/or the like for accessing map version agnostic information/datafor each of the route segments. For example, the network apparatus 10may store (e.g., in memory 14) a geographic database storing the mapinformation/data of the network version of the digital map. A segmentrecord corresponding to a route segment may be accessed and map versionagnostic information/data may be extracted therefrom. In an exampleembodiment, elements of the segment record to be accessed arepre-established and/or defined. For example, the map version agnosticidentifier may be generated using a map version agnostic identifieralgorithm and the mobile apparatus 20 and the network apparatus 10 mayuse the same map version agnostic identifier algorithm. For example, themap version agnostic map information/data accessed may include a roadname, segment length, a direction of travel of a segment, a functionalclass of a segment, speed limit, segment midpoint, and/or the like, invarious embodiments.

At block 404, a set S of map version agnostic route segment identifiersare generated for each route segment of the route segment set. Forexample, the network apparatus 10 may generate a set S of map versionagnostic route segment identifiers. For example, the network apparatus10 may comprise means, such as the processor 12, memory 14, and/or thelike, for generating a set S of map version agnostic route segmentidentifiers. For example, the accessed map version agnosticinformation/data corresponding to a route segment may be combined in apre-established and/or defined manner to generate a map version agnosticidentifier configured to identify the route segment. For example, a mapversion agnostic identifier for each route segment of the route segmentset (e.g. each route segment of the route) may be generated and added tothe set S of map version agnostic route segment identifiers. Forexample, in an example embodiment, the map version agnostic identifiermay be a text string generated by concatenating a functional classindicator and a travel direction to a road name.

At block 406, the elements of the set S of map version agnostic routesegment identifiers (e.g., the map version agnostic identifier for eachroute segment) are coded using one or more coding functions and added tothe bloom filter. For example, the network apparatus 10 may code theelements of the set S of map version agnostic route segment identifiersusing one or more coding functions and adding the coded version(s) ofthe elements of the set S to the bloom filter. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like, for coding each of the elements of the set S of map versionagnostic route segment identifiers using one or more coding functionsand adding the coded version(s) of the elements of the set S to thebloom filter. For example, each coding function may receive a mapversion agnostic identifier as input and provide as output a codedversion of the map version agnostic identifier. In various embodiments,the coded version of the map version agnostic identifier is an indexvalue corresponding to an index of the bloom filter. In an exampleembodiment, the bloom filter is initiated as a bit array of size m withall m bits of the bit array set to zero. In various embodiments, m is apositive integer. In an example embodiment, the bloom filter isinitiated with a size that is relatively small (e.g., m equal to thenumber of route segments in the route segment set and/or the number ofelements in the set S) such that the probability of false positives isarbitrarily high. The coded version of the map version agnosticidentifier is added to the bloom filter by setting a bit of the bitarray of the bloom filter corresponding to the index value equal to 1.Each map version agnostic identifier of the set S is coded with k codingfunctions and the corresponding k coded versions of the map versionagnostic identifier are added to the bloom filter. In variousembodiments, k is a positive integer.

At block 408, the adjacent segments of the route are identified and mapversion agnostic information/data corresponding to each of the adjacentsegments of the route is accessed. In various embodiments, an adjacentsegment is a segment that intersects a route but that is not part of theroute. For example, an adjacent segment is directly connected to a routesegment, but is not a route segment (e.g., is associated with a sameintersection or node as a route segment but is not a member of the routesegment set). For example, FIG. 6B shows a route in bold line thatcomprises route segments A, B, D, Z, and L and having adjacent segmentsC, E, J, K, and M. For example, each adjacent segment shares a definingnode or intersection 606 with a route segment, but is not itself a routesegment. For example, the network apparatus 10 may identify the adjacentsegments of the route and access map version agnostic information/datafor each of the adjacent segments. For example, the network apparatus 10may comprise means, such as processor 12, memory 14, and/or the like foridentifying the adjacent segments of a route and accessing map versionagnostic information/data for each of the adjacent segments. Forexample, the network apparatus 10 may store (e.g., in memory 14) ageographic database storing the map information/data of the networkversion of the digital map. A segment record corresponding to anadjacent segment may be accessed and map version agnosticinformation/data may be extracted therefrom. In an example embodiment,elements of the adjacent record to be accessed are pre-establishedand/or defined and are the same elements that were accessed for theroute segments. For example, the map version agnostic mapinformation/data accessed may include a road name, segment length, adirection of travel of a segment, a functional class of a segment, speedlimit, segment midpoint, and/or the like, in various embodiments.

At block 410, a set T of map version agnostic adjacent segmentidentifiers are generated. For example, the network apparatus 10 maygenerate a set T of map version agnostic adjacent segment identifiers.For example, the network apparatus 10 may comprise means, such as theprocessor 12, memory 14, and/or the like, for generating a set T of mapversion agnostic adjacent segment identifiers. For example, the accessedmap version agnostic information/data corresponding to an adjacentsegment may be combined in a pre-established and/or defined manner togenerate a map version agnostic identifier configured to identify theadjacent segment. For example, a map version agnostic identifier foreach adjacent segment of the route may be generated and added to the setT of map version agnostic adjacent segment identifiers. For example, inan example embodiment, the map version agnostic identifier may be a textstring generated by concatenating a functional class indicator and atravel direction to a road name. In various embodiments, the map versionagnostic identifiers for the adjacent segments are generated using thesame combination of elements of map version agnostic mapinformation/data as the map version agnostic identifiers for the routesegments.

At block 412, it is determined if any of the elements of T satisfy thebloom filter. For example, the network apparatus 10 may determine if anyof the elements of T satisfy the bloom filter. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for determining if any of the elements of T satisfy the bloomfilter. For example, each element of the set T of map version agnosticadjacent segment identifiers may be coded with the k coding functions togenerate k coded versions of each map version agnostic identifier foreach adjacent segment. It may be determined whether, for any of the mapversion agnostic identifiers of the set T, all k of the coded versionsof the map version agnostic identifier are present in the bloom filter.For example, it may be determined whether all k of the indexes of thebloom filter corresponding to the k coded versions of the map versionagnostic identifier of any of the adjacent segments of the routecorrespond to the value of 1 in the bit array of the bloom filter.

When it is determined that none of the elements of T satisfy the bloomfilter, the process continues to block 414. For example, when the bloomfilter does not provide a false positive for any of the adjacentsegments (e.g., indicating that none of the adjacent segment are part ofthe route), the process continues to block 414. At block 414, theproduced bloom filter is provided such that the route responsecomprising the bloom filter may be generated. For example, the networkapparatus 10 may provide the bloom filter such that the route responsecomprising the bloom filter may be generated. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for providing the bloom filter such that the route responsecomprising the bloom filter may be generated. For example, a bloomfilter producing module operating on and/or being executed by thenetwork apparatus 10 may produce the bloom filter and then, at block414, provide the bloom filter to a route response generation moduleoperating on and/or being executed by the network apparatus 10.

When it is determined that at least one element of T satisfies the bloomfilter, the process continues to block 416. For example, when the bloomfilter provides a false positive for at least one of the adjacentsegments (e.g., indicating that the at least one adjacent segment may bepart of the route), the process continues to block 416. At block 416, alarger bloom filter is generated. For example, the bloom filter at block406 may be of size m (e.g., be a bit array of m bits). At block 416, abloom filter of size m+n (e.g., a bit array of m+n bits) may begenerated. As used herein, n is a positive integer. In an exampleembodiment, n is 1, such that the minimum sized bloom filter that doesnot provide a false positive for any of the adjacent segments of theroute is generated. For example, using j coding functions, the elementsof the set S of map version agnostic route segment identifiers (e.g.,the map version agnostic identifier for each route segment) are codedusing one or more encoding functions and added to the larger bloomfilter. As used herein, j is a positive integer. The set of j codingfunctions may be the same set or a different set of coding functions asthe k coding functions used to generate the original bloom filter. Forexample, the network apparatus 10 may generate a larger bloom filterbased on the coded elements of the set S using the j coding functions.For example, the network apparatus 10 may comprise means, such asprocessor 12, memory 14, and/or the like, for generating a larger bloomfilter based on the coded elements of the S using the j codingfunctions.

As should be understood, once the bloom filter of size m+n is generated,the process returns to block 412 to determine if any of the elements ofset T of the map version agnostic adjacent segment identifiers satisfythe bloom filter. For example, it is determined if the bloom filterindicates that any of the adjacent segments may be part of the route.Responsive to determining that the (larger) bloom filter does notindicate that any of the adjacent segments may be part of the route, theprocess will then continue to block 414 and the produced bloom filterwill be provided. Responsive to determining that the (larger) bloomfilter does indicate that at least one of the adjacent segments may bepart of the route, the process returns to block 416 and a larger bloomfilter is generated. For example, a bloom filter of size m+n+p, where pis a positive integer, may be generated. In an example embodiment, pis 1. The process continues until the produced bloom filter indicatesthat none of the adjacent segments are part of the route (e.g., none ofthe elements of set T satisfy the bloom filter) and the produced bloomfilter is provided at block 414.

iii. Exemplary Operation of a Mobile Apparatus

In various embodiments, a mobile apparatus 20 provides (e.g., transmits)a route request. A network apparatus 10 receives the route request,generates a route, encodes a route segment set defined by the route, andprovides a route response. The mobile apparatus 20 receives the routeresponse and then generates a decoded route based on a bloom filterprovided by the route response. The mobile apparatus 20 may then use thedecoded route to perform one or more navigation functions. Somenon-limiting examples of navigation functions include providing a route(e.g., via a user interface), localization, route determination, lanelevel route determination, operating a vehicle along a lane level route,route travel time determination, lane maintenance, route guidance, lanelevel route guidance, provision of traffic information/data, provisionof lane level traffic information/data, vehicle trajectory determinationand/or guidance, vehicle speed and/or handling control, route and/ormaneuver visualization, and/or the like.

FIG. 5 provides a flowchart illustrating operations performed, such asby the mobile apparatus 20 to request, receive, and decode a routesegment set encoded by a bloom filter, in accordance with an exampleembodiment. Starting at block 502, a route request is generated andprovided such that the network apparatus 10 receives the route request.For example, the mobile apparatus 20 may generate and provide (e.g.,transmit) a route request. For example, the mobile apparatus 20 maycomprise means, such as processor 22, memory 24, communicationsinterface 26, user interface 28, location sensor 29, and/or the like,for generating and providing a route request.

In various embodiments, the route request may comprise a mobileapparatus identifier identifying the mobile apparatus 20 that generatedand provided the route request, map version agnostic information/dataidentifying a starting location, map version agnostic information/dataidentifying a target location, one or more parameters for the route(e.g., shortest distance, shortest expected travel time, avoid tolls,avoid highways, driving route, biking route, walking route, and/or thelike), and/or the like. In various embodiments, the information/dataidentifying the starting location and the target location areindependent of a version of the digital map.

For example, a user may interact with the user interface 28 and requesta route. For example, the user may, operate the user interface 28 toindicate an origin of the route, a destination of the route, and/or oneor more parameters for the route (e.g., shortest distance, shortestexpected travel time, avoid tolls, avoid highway, driving route, bikingroute, walking route, and/or the like). The user may then operate theuser interface 28 to submit the user provided and/or selectedinformation/data and to initiate the generation of the route request. Inan example embodiment, the origin of the route is the current locationof the mobile apparatus 20 as determined by on one or more locationsensors 29 of the mobile apparatus. In another example, a mobileapparatus 20 may determine that the mobile apparatus 20 is moving and/orthat a trip is expected to begin (e.g., based on historicalinformation/data corresponding to the user and/or the mobile apparatus20). The mobile apparatus 20 may determine a current location of themobile apparatus (e.g., via the location sensor(s) 29) and determine apredicted destination of the route (based on past trips,information/data stored in a digital calendar corresponding to a user ofthe mobile apparatus 20, based on planned trips, and/or the like). Themobile apparatus 20 may then automatically initiate the generation of aroute request.

As noted above, the mobile apparatus 20 may receive (e.g., via userinterface 28 and/or from location sensor 29) an origin of the route. Themobile apparatus 20 may then map match the origin of the route to asegment of the mobile version of the digital map. This mobile versionstarting segment (e.g., a segment of a mobile version of the digital mapto which the origin has been map-matched) is used to determine the mapversion agnostic information/data identifying the starting location. Inan example embodiment, the information/data identifying the startinglocation is provided as the midpoint and z-level of the mobile versionstarting segment. The midpoint of a segment is the coordinate pair(e.g., latitude and longitude) of the point that is approximatelyhalfway down the segment, where the ends of the road segment are definedby intersections or nodes. For example, the midpoint of a segment is apoint in the middle of the segment between the two intersections thatdefine the ends of the segment. The z-level of a segment describes therelative location of roads that are stacked. For most segments, thez-level is 0 (e.g., unstacked and/or on ground level); however, fortunnels the z-level might be negative and for stacked roads/bridgesz-level might be positive. The mobile apparatus may further map matchthe destination for the route to a segment of the mobile version of thedigital map. This mobile version target segment (e.g., a segment of themobile version of the digital map to which the destination has beenmap-matched) is used to determine the map version agnosticinformation/data identifying the target location. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version target segment.

At block 504, a route response is received. For example, the networkapparatus 10 may generate and provide a route response, in response tothe route request, and provide the route response such that the mobileapparatus 20 receives the route response. For example, the mobileapparatus 20 may receive the route response. For example, the mobileapparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, and/or the like for receiving the routeresponse. In various embodiments, the route response comprises the bloomfilter (e.g., as a bit array). In an example embodiment, the routeresponse comprises information/data identifying a network versionstarting location and information/data identifying a network versiontarget location. In various embodiments, the information/dataidentifying the network version starting location and network versiontarget location is map version agnostic. For example, in an exampleembodiment, the information/data identifying the network versionstarting location is the midpoint of (or other point along) the networkversion starting segment and the z-level of the network version startingsegment, and the information/data identifying the network version targetsegment is the midpoint of (or other point along) the network versiontarget segment and the z-level of the network version target segment. Inan example embodiment, the route response includes a route lengthindicating the length (e.g., in miles, kilometers, feet, meters, and/orthe like) for the encoded route segment set defined by the route.

At block 506, a decoded starting segment and decoded target segment areidentified. For example, the mobile apparatus 20 may identify and/ordetermine a decoded starting segment and a decoded target segment usingthe mobile version of the digital map. For example, the mobile apparatus20 may comprise means, such as processor 22, memory 24, and/or the like,for identifying and/or determining a decoded starting segment and adecoded target segment using the mobile version of the digital map. Forexample, the map version agnostic information/data identifying thenetwork version starting location may be map-matched using the mobileversion of the digital map to identify a decoded starting segmentcorresponding to the network version starting location. Similarly, themap version agnostic information/data identifying the network versiontarget location may be map-matched using the mobile version of thedigital map to identify a decoded target location corresponding to thenetwork version target location.

At block 508, map information/data from the mobile version of thedigital map for assigning cost values to segments of the mobile versionof the digital map is accessed. For example, the mobile apparatus 20 mayaccess map information/data from a geographic database storing mapinformation/data of the mobile version of the digital map from memory24.

In various embodiments, the cost value assigned to a segment isdetermined based on whether the segment satisfies the bloom filter. Forexample, if a coded map version agnostic identifier corresponding to afirst segment satisfies the bloom filter, the first segment is assigneda minimal cost value. For example, the first segment may be assigned acost value of zero. However, if the coded map version agnosticidentifier corresponding to the first segment does not satisfy the bloomfilter, the first segment is assigned a positive cost value (e.g., basedon the length of the segment, expected time of traversal for thesegment, a current or expected traffic level for the segment, and/or thelike). Thus, accessing map information/data for use in assigning costvalues to segments further includes accessing map information/data fromthe mobile version of the digital map that may be used for determiningif a segment satisfies the bloom filter. For example, a segment recordcorresponding to a segment may be accessed and map version agnosticinformation/data may be extracted therefrom. In an example embodiment,elements of the segment record to be accessed for generating a mapversion agnostic identifier for the segment are pre-established and/ordefined. In particular, the elements of the segment record to beaccessed for use in generating a map version agnostic identifier are thesame elements of the network version of the digital map used by thenetwork apparatus to generate the map version agnostic identifiers thatwere coded to produce the bloom filter. For example, the map versionagnostic identifier may be generated using a map version agnosticidentifier algorithm and the mobile apparatus 20 and the networkapparatus 10 may use the same map version agnostic identifier algorithm.For example, the map version agnostic map information/data accessed mayinclude a road name, segment length, a direction of travel of a segment,a functional class of a segment, speed limit, segment midpoint, and/orthe like, in various embodiments.

The map version agnostic map information/data corresponding to a segmentmay then be used to generate a map version agnostic identifier for thesegment. For example, the accessed map version agnostic information/datacorresponding to a segment may be combined in a pre-established and/ordefined manner (e.g., in the same manner as the generation of the mapversion agnostic identifiers where generated by the network apparatus10) to generate a map version agnostic identifier configured to identifythe segment. The map version agnostic identifier may then be used todetermine if the corresponding segment satisfies the bloom filter. Ifthe segment satisfies the bloom filter, the segment is assigned aminimal (e.g., zero) cost value. If the segment does not satisfy thebloom filter, the segment may be assigned a cost value based on mapinformation/data. For example, the accessed map information/data mayinclude map information/data that may be used to assign a cost value toa segment of the mobile version of the digital map. In an exampleembodiment, the cost value assigned to a segment may be the length ofthe segment, the expected time to traverse the segment, a traffic levelindicator, and/or the like, as described above.

In an example embodiment, block 508 may be performed concurrently withblock 510 such that the map information/data for assigning a cost valueto a first segment is accessed when a route determining algorithm isexpanded to the first segment. For example, map information/data forassigning a cost value to a first segment may be accessed and the costvalue assigned to the first segment based thereon, in response to aroute determining algorithm considering whether the first segment ispart of the decoded route.

At block 510, a decoded route is determined by identifying the lowestcost route from the decoded starting segment to the decoded targetsegment is determined. For example, the mobile apparatus 20 maydetermine a decoded route by determining the lowest cost route from thedecoded starting segment to the decoded target segment. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,and/or the like, for determining a decoded route by determining thelowest cost route from the decoded starting segment to the decodedtarget segment. For example, the lowest cost route may be determinedbased on the cost value assigned to segments between the decodedstarting segment and the decoded target segment. In various embodiments,a best-first algorithm may be used to determine the decoded route. In anexample embodiment, a version of Dijkstra's algorithm or another costminimization algorithm may be used to determine the decoded route.

FIG. 6A illustrates a route 600 from network version starting segment602 to network version target segment 604. The route segments of theroute 600 are separated by intersections and/or nodes 606. FIG. 6Billustrates a portion of the road network 650 as represented by themobile version of the digital map with the corresponding cost valuesindicated. The route 600 is included as bold lines between the decodedstarting segment 652 and the decoded target segment 654. Segment Z isshown as a dashed line without an assigned cost value as segment Z isnot present in the mobile version of the digital map (e.g., the mobileversion of the digital map does not comprise a segment recordcorresponding to segment Z). The segments are separated by intersectionsand/or nodes 656 of the mobile version of the digital map. As can beseen from FIGS. 6A and 6B, the segments of the mobile version of thedigital map that satisfy the bloom filter are assigned a minimal (e.g.,zero) cost value. In the illustrated embodiment, the segments of themobile version of the digital map that do not satisfy the bloom filterare assigned a cost value that is equal to the length of the segment.The segments of the mobile version of the digital map that correspond tothe adjacent segments of the route (according to the network version ofthe digital map) do not satisfy the bloom filter and are thereforeassigned positive cost values. As should be understood, the cost valueassigned to a segment will always be zero or larger (i.e., notnegative). Therefore, any algorithm used to determine the lowest costroute will be biased toward selecting the segments of the mobile versionof the digital map that correspond to the route segments of the networkversion of the digital map. For example, for the route illustrated inFIGS. 6A and 6B, the lowest cost route from the decoded starting segment652 to the decoded target segment 654 includes segment A, segment B,segment D, segment J, segment K, and segment L having a total cost of 30m. If the mobile version of the digital map included segment Z, thelowest cost route from the decoded starting segment 652 to the decodedtarget segment 654 includes segment A, segment B, segment D, segment Z,and segment L having a total cost of 0. However, the route includingsegment A, segment B, segment E, segment N, segment M, and segment Lwould not be selected as the decoded route as it is not the lowest costroute from the decoded starting segment 652 to the decoded targetsegment 654. Thus, various embodiments provide for the determination ofa decoded route using a map version that is different from the mapversion used to encode the route segment set defined by the route thatallows for automatic and efficient self-healing of the route fordisparities between the map version used encode the route segment setand the map version used to generate the decoded route.

Continuing with FIG. 5, at block 512, it is determined if the decodedroute satisfies one or more quality measures. In an example embodiment,the one or more quality measures comprise the length of the decodedroute being similar to the route length provided as part of the routeresponse. For example, a decoded route length may be determined andcompared to the route length provided by the route response. In anexample embodiment, the decoded route length is determined by summingthe length of each segment in the decoded route based on the mobileversion of the digital map. For example, it may be determined if thedecoded route length and the route length satisfy a similarity thresholdrequirement. In an example embodiment, the ratio of the decoded routelength and the route length may be compared to a similarity range todetermine if the decoded route length and the route length satisfy asimilarity threshold requirement. For example, if the ratio of thedecoded route length to the route length is in within the similarityrange, it may be determined that the decoded route is an acceptableroute. If the ratio of the decoded route length to the route length isnot within the similarity range, it may be determined that the decodedroute is not an acceptable route. In various embodiments, the similarityrange is a predetermined range. In some example embodiments, thesimilarity range is 0.7 to 1.3, 0.75 to 1.25, 0.8 to 1.2, 0.85 to 1.15,0.9 to 1.1, and/or 0.95 to 1.05. For example, the mobile apparatus 20may determine if the decoded route length and the route length satisfy asimilarity threshold requirement. For example, the mobile apparatus 20may comprise means, such as processor 22, memory 24, and/or the like,for determining if the decoded route length and the route length satisfythe similarity threshold requirement.

In an example embodiment, the one or more quality measures may includedetermining whether the number of elements in the bloom filter that themobile apparatus 20 cannot resolve satisfies a quality thresholdrequirement. For example, as shown in FIGS. 6A and 6B, the route 600generated by the network apparatus 10 may comprise segment Z. However,segment Z is not present in the mobile version of the digital map (e.g.,the mobile version of the digital map does not comprise a segment recordcorresponding to segment Z). Thus, the mobile apparatus 20 cannotresolve segment Z from the bloom filter. In an example embodiment, themobile apparatus 20 may determine that an unresolved element of thebloom filter exists because, for the example of route 600, segment D isnot the decoded target segment for the decoded route 650, but a segmentthat leaves segment D and that satisfies the bloom filter cannot beidentified based on the mobile version of the digital map. As routesmust be continuous, there must be a segment of the network version ofthe digital map leaves segment D (e.g., is also associated withintersection 680) that does satisfy the bloom filter. However thissegment is not a part of the mobile version of the digital map, in theillustrated scenario and therefore is identified as an element of thebloom filter that cannot be resolved by the mobile apparatus 20. Whenthe number of elements of the bloom filter that cannot be resolved bythe mobile apparatus 20 fails to satisfy a quality threshold requirement(e.g., exceeds a quality threshold number), it may be determined thatthe decoded route fails to satisfy a quality measure.

When it is determined that the decoded route satisfies the one or morequality measures (e.g., the decoded route length and the route lengthsatisfy the similarity threshold requirement), the process continues toblock 514 and the route is accepted. For example, the mobile apparatus20 may accept the route and use the route to complete one or morenavigation functions. For example, the mobile apparatus 20 may comprisemeans, such as processor 22, memory 24, communications interface 26,user interface 28, sensors 29, and/or the like, for (responsive todetermining that the decoded route satisfies the one or more qualitymeasures) accepting the decoded route and using the decoded route toperform one or more navigation functions. Some non-limiting examples ofnavigation functions include providing a route (e.g., via a userinterface), localization, route determination, lane level routedetermination, operating a vehicle along a lane level route, routetravel time determination, lane maintenance, route guidance, lane levelroute guidance, provision of traffic information/data, provision of lanelevel traffic information/data, vehicle trajectory determination and/orguidance, vehicle speed and/or handling control, route and/or maneuvervisualization, and/or the like. In an example embodiment, as the mobileapparatus 20 traverses the decoded route, if it is determined that themobile apparatus 20 is traversing a segment that is not part of thedecoded route and/or does not satisfy the bloom filter, the mobileapparatus 20 may automatically request a new route from the networkapparatus 10.

When it is determined that the decoded route does not satisfy at leastone quality measure (e.g., the decoded route length and the route lengthdo not satisfy the similarity threshold requirement), the processcontinues to block 516. At block 516, the route is rejected and a newroute is requested. For example, the mobile apparatus 20 may rejectedthe route and request a new route. For example, the mobile apparatus 20may comprise means, such as processor 22, memory 24, communicationsinterface 26, and/or the like for (responsive to determining that thedecoded route fails to satisfy at last one quality measure) rejectingthe route and requesting a new route. In an example embodiment, therequest for the new route may provide information/data that may be usedby the network apparatus 10 to identify the elements of the bloom filterthat could not be resolved by the mobile apparatus 20 such that thenetwork apparatus 10 may avoid using the corresponding segments in a newroute. For example, the information/data that may be used by the networkapparatus 10 to identify the elements of the bloom filter that could notbe resolved by the mobile apparatus 20 may include a map versionagnostic identifier for the segment immediately preceding and/orimmediately succeeding the unresolved element, information/dataidentifying a node and/or intersection corresponding to the unresolvedelement, and/or the like. For example, the mobile apparatus 20 maygenerate an updated and/or modified route request and provide (e.g.,transmit) the updated and/or modified route request such that thenetwork apparatus 10 receives the updated and/or modified route request.In response to the updated and/or modified route request, the networkapparatus 10 may generate a new route, encode a route segment setdefined by the same or the new route with a larger bloom filter (e.g., abit array having more bits than the previously provided bloom filter)and/or the like. The network apparatus 10 may then provide an updatedand/or modified route response comprising the route segment set definedby the new route encoded as a bloom filter, the route segment setdefined by the previous route encoded with a larger bloom filter, and/orthe like. The mobile apparatus 20 receives the updated and/or modifiedroute response and determines an updated and/or modified decoded route.In an example embodiment, the mobile apparatus 20 determines if theupdated and/or modified decoded route satisfies one or more qualitymeasures to determine if the updated and/or modified decoded route is tobe accepted or rejected and a new route is to be requested.

B. Multiple Stop Routes

In various embodiments, a multiple stop route may be requested. Forexample, a user may interact with a mobile apparatus 20 (e.g., via userinterface 28) to provide a list of errands to be run, stops to be madeand/or the like. The mobile apparatus 20 may generate and provide amultiple stop route request based on the user provided information. Anetwork apparatus 10 may receive the multiple stop route request,determine an optimal tour of the multiple stops, determine a route foreach leg of the multiple stop route, encode the route segment setdefined by each leg of the multiple stop route using a bloom filter, andprovide a multiple stop route response that includes the bloom filterfor each leg of the multiple stop route. The mobile apparatus 20 maythen determine a decoded route for each leg of the multiple stop routebased on the corresponding bloom filter. FIG. 7 provides a flowchartillustrating operations performed, such as by the network apparatus 10to provide a multiple stop route response, in accordance with an exampleembodiment and FIG. 8 provides a flowchart illustrating operationsperformed, such as by the mobile apparatus 20 to decode legs of amultiple stop route based on a received multiple stop route response, inaccordance with an example embodiment.

i. Exemplary Operation of a Network Apparatus

Starting at block 702 of FIG. 7, a multiple stop route request isreceived. For example, the network apparatus 10 may receive a multiplestop route request. For example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, communications interface 16,and/or the like for receiving a multiple stop route request. In variousembodiments, the multiple stop route request may comprise a mobileapparatus identifier identifying the mobile apparatus 20 that providedthe multiple stop route request, map version agnostic information/dataidentifying a starting location, map version agnostic information/dataidentifying a target location, map version agnostic information/dataidentifying each stop location, one or more parameters for the route(e.g., shortest distance, shortest expected travel time, avoid tolls,avoid highways, driving route, biking route, walking route, and/or thelike), and/or the like. In various embodiments, the information/dataidentifying the starting location, the target location, and each of thestop locations is independent of a version of the digital map. In anexample embodiment, the information/data identifying the startinglocation is provided as the midpoint and z-level of a mobile versionsegment corresponding to the current location/position of the mobileapparatus and/or a user provided origin for the route. The midpoint of asegment is the coordinate pair (e.g., latitude and longitude) of thepoint that is approximately halfway down the segment, where the ends ofthe road segment are defined by intersections or nodes. For example, themidpoint of a segment is a point in the middle of the segment betweenthe two intersections that define the ends of the segment. The z-levelof a segment describes the relative location of roads that are stacked.For most segments, the z-level is 0 (e.g., unstacked and/or on groundlevel); however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version segmentcorresponding to a user provided and/or selected destination of theroute and/or a predicted destination of the route. In variousembodiments, the information/data identifying the stop location(s) forthe route may be provided as the midpoint and z-level of a mobileversion segment corresponding to a user requested stop, a POI name(e.g., the name of a particular store), a geolocation for the stop(e.g., latitude and longitude), a street address for the stop, and/orother map version agnostic information/data identifying a stop location.In an example embodiment, the multiple stop route request may furtherinclude one or more order conditions. For example, the multiple stoproute request may indicate that a particular stop needs to be completedfirst (e.g., dropping a child off at daycare), a particular stop needsto be completed last (e.g., picking up perishables at the grocery storeor a farmer's market), a particular stop needs to be completed around orby particular time (e.g., picking a child up from soccer practice),and/or the like.

At block 704, the starting segment, target segment, and waypointsegment(s) of the network version of the digital map are identified. Forexample, the network apparatus 10 may identify the starting segment,target segment, and way point segment(s) of the network version of thedigital map. For example, the network apparatus 10 may comprise means,such as processor 12, memory 14, and/or the like for identifying thestarting segment, target segment, and way point segment(s) of thenetwork version of the digital map. For example, the information/dataidentifying the starting location may be map-matched (e.g., using a mapmatching algorithm, engine, and/or the like) based on the networkversion of the digital map to identify the starting segment of thenetwork version of the digital map (also referred to as the networkversion starting segment herein). For example, the information/dataidentifying the target location may be map-matched (e.g., using a mapmatching algorithm, engine, and/or the like) based on the networkversion of the digital map to identify the target segment of the networkversion of the digital map (also referred to as the network versiontarget segment herein). For example, the information/data identifyingeach stop location may be map-matched (e.g., using a map matchingalgorithm, engine, and/or the like) based on the network version of thedigital map to identify a corresponding waypoint segment of the networkversion of the digital map (also referred to as a network versionwaypoint segment herein). In various embodiments, the information/dataidentifying the information/data identifying the starting location,target location, and/or stop location(s) may be map-matched to thenetwork version of the digital map such that an error up to a preseterror in the matching of the midpoint corresponding to thestarting/target/stop location to the midpoint of the correspondingsegment of the network version of the digital map. The z-levelcorresponding to the starting location, target location, and/or stoplocation(s) may be used for tie breaking in the case where the startinglocation, target location, and/or stop location(s) corresponds to atunnel, bridge, stacked roads, and/or the like. If the network apparatuscannot exactly match (e.g., within the preset error) a network versionstart segment, network version target segment, and/or network versionwaypoint segment(s) of the to the information/data identifying the startlocation, target location, and/or stop location(s), the multiple stoproute response may include a flag indicating such.

At block 706, a route starting at the network version starting segment,passing through each of the network version waypoint segments, andending at the network version target segment is determined. For example,the network apparatus 10 may determine a route starting at the networkversion starting segment, passing through each of the network versionwaypoint segments, and ending at the network version target segment. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, and/or the like, for determining a route starting at thenetwork version starting segment, passing through each of the networkversion waypoint segments, and ending at the network version targetsegment. In various embodiments, the route is determined in accordancewith any order conditions provided in the multiple stop route request.

A variety of route determining algorithms may be used, in variousembodiments, to determine a route starting at the network versionstarting segment, passing through each of the network version waypointsegments, and ending at the network version target segment. In variousembodiments, a route determining algorithm that uses cost values is usedto determine the route. For example, a best-first algorithm may be usedto determine a route starting at the network version starting segment,passing through each of the network version waypoint segments, andending at the network version target segment. For example, a modifiedDijkstra's algorithm or another cost minimization algorithm may be usedto determine the route starting at the network version starting segment,passing through each of the network version waypoint segments, andending at the network version target segment. In an example embodiment,the route may be designated as an ordered list or set of route segmentsfor each leg of the route (e.g., between the network version startingsegment and the first network version waypoint segment, betweenconsecutive network version waypoint segments, and/or between the finalnetwork version waypoint segment and the network version target segment)and an ordered list of destinations for each leg. For example a routesegment set may be defined for each leg. For example, to determine theroute, an ordered list or set of route segments for each leg (and/orsegment identifiers of the network version of the digital mapidentifying the route segments) and an ordered list of destinations foreach leg may be generated.

At block 708, a bloom filter is produced for each leg of the route. Forexample, a bloom filters that each encode a route segment setcorresponding to an individual leg of the route may be produced. Forexample, the network apparatus 10 may produce a bloom filtercorresponding to each leg of the route, wherein the bloom filter encodesthe route segments set corresponding to the associated leg of the route.For example, the network apparatus 10 may comprise means, such asprocessor 12, memory 14, and/or the like for producing a bloom filtercorresponding to each leg of the route, wherein the bloom filter encodesthe route segments set corresponding to the associated leg of the route.In various embodiments, each leg may be encoded into a separate bloomfilter. For example, for a route having a network waypoint segments(e.g., α intermediary stops between the origin and the final destinationof the route), α+1 bloom filters are produced. In various embodiments,the bloom filters are produced in a manner similar to that describedwith respect to FIG. 4.

At block 710, a multiple stop route response is generated and provided.For example, the network apparatus 10 may generate and provide amultiple stop route request. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, communicationsinterface 16, and/or the like, for generating and providing (e.g.,transmitting) a multiple stop route request. In various embodiments, theroute response comprises the bloom filter (e.g., as a bit array). In anexample embodiment, the route response comprises an ordered list ofstops or waypoints. For example, the ordered list of stops or waypointsmay include information/data identifying a network version startinglocation, each network version waypoint location (in the ordered theyare to be visited along the multiple stop route) and a network versiontarget location. In various embodiments, the information/dataidentifying the network version starting location, each network versionwaypoint location, and network version target location is map versionagnostic. For example, in an example embodiment, the information/dataidentifying the network version starting location is the midpoint of (orother point along) the network version starting segment and the z-levelof the network version starting segment. Similarly, the information/dataidentifying a network version waypoint location may be the midpoint of(or other point along) the corresponding network version waypointsegment and the z-level of the corresponding network version waypointsegment. In an example embodiment, the information/data identifying thenetwork version target segment is the midpoint of (or other point along)the network version target segment and the z-level of the networkversion target segment. In an example embodiment, generating themultiple stop route response includes determining a length of each legof the route. For example, the length of each route segment of a leg maybe summed to determine a length of the corresponding leg of the route.The length of each leg of the route may then be included in the routeresponse, in an example embodiment. For example, the ordered list ofstops or waypoints may include a length for each leg of the route. In anexample embodiment a total length of the route may be determined andprovided as part of the multiple stop route response in addition toand/or in place of the length of each leg of the route.

ii. Exemplary Operation of a Mobile Apparatus

Starting at block 802 of FIG. 8, a multiple stop route request isgenerated and provided such that the network apparatus 10 receives themultiple stop route request. For example, the mobile apparatus 20 maygenerate and provide (e.g., transmit) a multiple stop route request. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, communications interface 26, user interface 28, locationsensor 29, and/or the like, for generating and providing a multiple stoproute request.

In various embodiments, the multiple stop route request may comprise amobile apparatus identifier identifying the mobile apparatus 20 thatgenerated and provided the multiple stop route request, map versionagnostic information/data identifying a starting location, map versionagnostic information/data identifying a target location, map versionagnostic information/data identifying one or more intermediate stops,one or more parameters for the route (e.g., shortest distance, shortestexpected travel time, avoid tolls, avoid highways, driving route, bikingroute, walking route, and/or the like), one or more order conditionscorresponding to requirements or preferences regarding the order ortiming with which intermediate stops of the route should be made, and/orthe like. In various embodiments, the information/data identifying thestarting location, one or more intermediate stops, and the targetlocation are independent of a version of the digital map.

For example, a user may interact with the user interface 28 and requesta multiple stop route. For example, the user may, operate the userinterface 28 to indicate an origin of the route, one or moreintermediate stops of the route, a destination of the route, one or moreorder conditions, and/or one or more parameters for the route (e.g.,shortest distance, shortest expected travel time, avoid tolls, avoidhighway, driving route, biking route, walking route, and/or the like).The user may then operate the user interface 28 to submit the userprovided and/or selected information/data and to initiate the generationof the multiple stop route request. In an example embodiment, the originof the route is the current location of the mobile apparatus 20 asdetermined by on one or more location sensors 29 of the mobileapparatus. In another example, a mobile apparatus 20 may determine thatthe mobile apparatus 20 is moving and/or that a trip is expected tobegin. The mobile apparatus 20 may determine a current location of themobile apparatus (e.g., via the location sensor(s) 29) and determine apredicted destination of the route (based on past trips,information/data stored in a digital calendar corresponding to a user ofthe mobile apparatus 20, based on planned trips, and/or the like). Themobile apparatus 20 may then automatically initiate the generation of aroute request.

As noted above, the mobile apparatus 20 may receive (e.g., via userinterface 28 and/or from location sensor 29) an origin of the route. Themobile apparatus 20 may then map match the origin of the route to asegment of the mobile version of the digital map. This mobile versionstarting segment (e.g., a segment of a mobile version of the digital mapto which the origin has been map-matched) is used to determine the mapversion agnostic information/data identifying the starting location. Inan example embodiment, the information/data identifying the startinglocation is provided as the midpoint and z-level of the mobile versionstarting segment. The midpoint of a segment is the coordinate pair(e.g., latitude and longitude) of the point that is approximatelyhalfway down the segment, where the ends of the road segment are definedby intersections or nodes. For example, the midpoint of a segment is apoint in the middle of the segment between the two intersections thatdefine the ends of the segment. The z-level of a segment describes therelative location of roads that are stacked. For most segments, thez-level is 0 (e.g., unstacked and/or on ground level); however, fortunnels the z-level might be negative and for stacked roads/bridgesz-level might be positive. The mobile apparatus may further map matchthe destination for the route to a segment of the mobile version of thedigital map. This mobile version target segment (e.g., a segment of themobile version of the digital map to which the destination has beenmap-matched) is used to determine the map version agnosticinformation/data identifying the target location. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version target segment.In various embodiments, the information/data identifying the stoplocation(s) for the route may be provided as the midpoint and z-level ofa mobile version segment corresponding to a user requested stop, a POIname (e.g., the name of a particular store), a geolocation for the stop(e.g., latitude and longitude), a street address for the stop, and/orother map version agnostic information/data identifying a stop location.

At block 804, a multiple stop route response is received. For example,the network apparatus 10 may generate and provide a multiple stop routeresponse, in response to the multiple stop route request, and providethe multiple stop route response such that the mobile apparatus 20receives the multiple stop route response. For example, the mobileapparatus 20 may receive the multiple stop route response. For example,the mobile apparatus 20 may comprise means, such as processor 22, memory24, communications interface 26, and/or the like for receiving themultiple stop route response. In various embodiments, the multiple stoproute response comprises a bloom filter (e.g., as a bit array) for eachleg of the route. In an example embodiment, the multiple stop routeresponse comprises an ordered list of stops or waypoints. For example,the ordered list of stops or waypoints may include information/dataidentifying a network version starting location, each network versionwaypoint location (in the ordered they are to be visited along themultiple stop route) and a network version target location. The orderedlist of stops or waypoints may further include a length for each leg ofthe route. In an example embodiment, the multiple stop route responseincludes a total length of the route in addition to and/or in place ofthe length of each leg of the route.

At block 806, a decoded starting segment, one or more decoded waypointsegments, and a decoded target segment are identified. For example, themobile apparatus 20 may identify and/or determine a decoded startingsegment, one or more decoded waypoint segments, and a decoded targetsegment using the mobile version of the digital map. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,and/or the like, for identifying and/or determining a decoded startingsegment, one or more decoded waypoint segments and a decoded targetsegment using the mobile version of the digital map. For example, themap version agnostic information/data identifying the network versionstarting location may be map-matched using the mobile version of thedigital map to identify a decoded starting segment corresponding to thenetwork version starting location. For example, the map version agnosticinformation/data identifying each of the network version stop locationsmay be map-matched using the mobile version of the digital map toidentify a corresponding decoded waypoint segment. Similarly, the mapversion agnostic information/data identifying the network version targetlocation may be map-matched using the mobile version of the digital mapto identify a decoded target location corresponding to the networkversion target location.

At block 808, map information/data from the mobile version of thedigital map for assigning cost values to segments of the mobile versionof the digital map is accessed. For example, the mobile apparatus 20 mayaccess map information/data from a geographic database storing mapinformation/data of the mobile version of the digital map from memory24.

In various embodiments, a decoded leg route is determined for each legof the route independently. For example, the multiple stop routeresponse includes a first leg bloom filter and a second leg bloomfilter. The first leg bloom filter is used, in conjunction with thecorresponding beginning segment (e.g., the decoded starting segment orone of the one or more decoded waypoint segments) corresponding to theorigin of the first leg and ending segment (e.g., one of the one or moredecoded waypoint segments or the decoded target segment) correspondingto the destination of the first leg, to determine the first decoded legroute. The second leg bloom filter is used, in conjunction with thecorresponding beginning segment corresponding to the origin of thesecond leg and the ending segment corresponding to the destination ofthe second leg, to determine the second decoded leg route. The firstdecoded leg route and the second decoded leg route are determinedindependent of one another. Thus, the determination of each decoded legroute may be performed independently and a cost value is assigned to afirst segment during the determination of the first decoded leg routemay be different from a cost value assigned to the first segment duringthe determination of the second decoded leg route.

In various embodiments, the cost value assigned to a segment during thedetermination of a particular decoded leg route is determined based onwhether the segment satisfies the bloom filter corresponding to theparticular leg of the route. For example, if a coded map versionagnostic identifier corresponding to a first segment satisfies the bloomfilter corresponding to a particular leg of the route, the first segmentis assigned a minimal cost value for the determination of the particulardecoded leg route. For example, the first segment may be assigned a costvalue of zero. However, if the coded map version agnostic identifiercorresponding to the first segment does not satisfy the bloom filtercorresponding to the particular leg of the route, the first segment isassigned a positive cost value (e.g., based on the length of thesegment, expected time of traversal for the segment, a current orexpected traffic level for the segment, and/or the like) for thedetermination of the particular decoded leg route.

Thus, accessing map information/data for use in assigning cost values tosegments during the determination of one or more decoded leg routes ofthe route includes accessing map information/data from the mobileversion of the digital map that may be used for determining if a segmentsatisfies one or more bloom filters provided as part of the multiplestop route response. For example, a segment record corresponding to asegment may be accessed and map version agnostic information/data may beextracted therefrom. In an example embodiment, elements of the segmentrecord to be accessed for generating a map version agnostic identifierfor the segment are pre-established and/or defined. In particular, theelements of the segment record to be accessed for use in generating amap version agnostic identifier are the same elements of the networkversion of the digital map used by the network apparatus to generate themap version agnostic identifiers that were coded to produce the bloomfilters. For example, the map version agnostic identifier may begenerated using a map version agnostic identifier algorithm and themobile apparatus 20 and the network apparatus 10 may use the same mapversion agnostic identifier algorithm. For example, the map versionagnostic map information/data accessed may include a road name, segmentlength, a direction of travel of a segment, a functional class of asegment, speed limit, segment midpoint, and/or the like, in variousembodiments.

The map version agnostic map information/data corresponding to a segmentmay then be used to generate a map version agnostic identifier for thesegment. For example, the accessed map version agnostic information/datacorresponding to a route segment may be combined in a pre-establishedand/or defined manner (e.g., in the same manner as the generation of themap version agnostic identifiers where generated by the networkapparatus 10) to generate a map version agnostic identifier configuredto identify the segment. The map version agnostic identifier may then beused to determine if the corresponding segment satisfies one or more ofthe bloom filters provided in the multiple stop route response. If thesegment satisfies a bloom filter for a particular leg of the route, thesegment is assigned a minimal (e.g., zero) cost value when determiningthe particular decoded leg route. If the segment does not satisfy thebloom filter for the particular leg of the route, the segment may beassigned a cost value based on map information/data for determining theparticular decoded leg route. For example, the accessed mapinformation/data may include map information/data that may be used toassign a cost value to a segment of the mobile version of the digitalmap. In an example embodiment, the cost value assigned to a segment maybe the length of the segment, the expected time to traverse the segment,a traffic level indicator, and/or the like, as described above.

In an example embodiment, block 808 may be performed concurrently withblock 810 such that the map information/data for assigning a cost valueto a first segment is accessed when a route determining algorithm isexpanded to the first segment. For example, map information/data forassigning a cost value to a first segment may be accessed and the costvalue assigned to the first segment based thereon, in response to aroute determining algorithm considering whether the first segment ispart of the decoded route or a particular decoded leg route.

At block 810, a decoded leg route is determined for each leg of themultiple stop route. For example, a particular decoded leg route isdetermined for the particular leg of the multiple stop route byidentifying the lowest cost route from the beginning segment (e.g., thedecoded starting segment or one of the one or more decoded waypointsegments) corresponding to the origin of the particular leg and endingsegment (e.g., one of the one or more decoded waypoint segments or thedecoded target segment) corresponding to the destination of theparticular leg. For example, the mobile apparatus 20 may determine adecoded leg route for each leg of the route by determining the lowestcost route from the beginning segment to the ending segment for thatleg. For example, the mobile apparatus 20 may comprise means, such asprocessor 22, memory 24, and/or the like, for determining a decoded legroute for each leg of the route by determining the lowest cost routefrom the beginning segment to the ending segment of that route. Forexample, the lowest cost route for a leg may be determined based on thecost value assigned (based on the bloom filter for that leg) to segmentsbetween the beginning segment and the ending segment of the leg. Invarious embodiments, a best-first algorithm may be used to determineeach of the decoded leg routes. In an example embodiment, a version ofDijkstra's algorithm may be used to determine each of the decoded legroutes. A decoded route is then generated by ordering the decoded legroutes based on the ordered list of stops or waypoints provided by themultiple stop route response.

At block 812, it is determined if the decoded route and/or if eachdecoded leg route satisfies one or more quality measures. In an exampleembodiment, the one or more quality measures comprise the total lengthof the decoded route (e.g., the sum of the lengths of each of thedecoded leg routes) being similar to the total route length provided aspart of the multiple stop route response (and/or determined by summingthe leg lengths provided in the multiple stop route response). Forexample, a decoded route length may be determined and compared to thetotal route length provided by the multiple stop route response. In anexample embodiment, the decoded route length is determined by summingthe length of each segment in each of the decoded leg routes based onthe mobile version of the digital map. For example, it may be determinedif the decoded route length and the total route length satisfy asimilarity threshold requirement. In an example embodiment, the ratio ofthe decoded route length and the total route length may be compared to asimilarity range to determine if the decoded route length and the totalroute length satisfy a similarity threshold requirement. For example, ifthe ratio of the decoded route length to the total route length is inwithin the similarity range, it may be determined that the decoded routeis an acceptable route. If the ratio of the decoded route length to thetotal route length is not within the similarity range, it may bedetermined that the decoded route is not an acceptable route. In variousembodiments, the similarity range is a predetermined range. In someexample embodiments, the similarity range is 0.7 to 1.3, 0.75 to 1.25,0.8 to 1.2, 0.85 to 1.15, 0.9 to 1.1, and/or 0.95 to 1.05. For example,the mobile apparatus 20 may determine if the decoded route length andthe total route length satisfy a similarity threshold requirement. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, and/or the like, for determining if the decoded routelength and the total route length satisfy the similarity thresholdrequirement. In various embodiments, rather than and/or in addition todetermining if the decoded route length and the total route lengthsatisfy the similarity threshold requirement, it may be determined ifthe length of each decoded leg route and the corresponding length of theleg provided in the multiple stop route response satisfy a similaritythreshold requirement.

In an example embodiment, the one or more quality measures may includedetermining whether the number of elements in the bloom filter that themobile apparatus 20 cannot resolve satisfies a quality thresholdrequirement. When the number of elements of the bloom filter that cannotbe resolved by the mobile apparatus 20 fails to satisfy a qualitythreshold requirement (e.g., exceeds a quality threshold number), it maybe determined that the decoded route fails to satisfy a quality measure.

When it is determined that the decoded route and/or each of the decodedleg routes satisfy the one or more quality measures (e.g., the decodedroute length and the route length satisfy a similarity thresholdrequirement, the length of each of the decoded leg routes and thecorresponding length of the leg provided in the multiple stop routeresponse satisfy a similarity threshold requirement), the processcontinues to block 814 and the route is accepted. For example, themobile apparatus 20 may accept the decoded route and use the decodedroute to complete one or more navigation functions. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, user interface 28, sensors 29, and/or thelike, for (responsive to determining that the decoded route satisfiesthe one or more quality measures) accepting the decoded route and usingthe decoded route to perform one or more navigation functions. Somenon-limiting examples of navigation functions include providing a route(e.g., via a user interface), localization, route determination, lanelevel route determination, operating a vehicle along a lane level route,route travel time determination, lane maintenance, route guidance, lanelevel route guidance, provision of traffic information/data, provisionof lane level traffic information/data, vehicle trajectory determinationand/or guidance, vehicle speed and/or handling control, route and/ormaneuver visualization, and/or the like.

When it is determined that the decoded route does not satisfy at leastone quality measure (e.g., the decoded route length and the route lengthdo not satisfy the similarity threshold requirement, the length of atleast one of the decoded leg routes and the corresponding length of theleg provided in the multiple stop route response do not satisfy asimilarity threshold requirement), the process continues to block 816.At block 816, the route and/or one or more legs of the route arerejected and a new route is requested. For example, the mobile apparatus20 may rejected the route and/or one or more legs of the route andrequest a new route. For example, the mobile apparatus 20 may comprisemeans, such as processor 22, memory 24, communications interface 26,and/or the like for (responsive to determining that the decoded routefails to satisfy at last one quality measure) rejecting the route and/orone or more legs of the route and requesting a new route. For example,the mobile apparatus 20 may generate an updated and/or modified multiplestop route request and provide (e.g., transmit) the updated and/ormodified multiple stop route request such that the network apparatus 10receives the updated and/or modified multiple stop route request. Inresponse to the updated and/or modified multiple stop route request, thenetwork apparatus 10 may generate a new route or new legs of the route,encode a route segment set defined by the same or the new route with alarger bloom filter for at least one of the legs (e.g., a bit arrayhaving more bits than the previously provided bloom filter for the atleast one of the legs) and/or the like. The network apparatus 10 maythen provide an updated and/or modified multiple stop route responsecomprising a plurality of bloom filters (e.g., one bloom filter for eachleg of the route), and/or the like. The mobile apparatus 20 receives theupdated and/or modified multiple stop route response and determines anupdated and/or modified decoded route. In an example embodiment, themobile apparatus 20 determines if the updated and/or modified decodedroute satisfies one or more quality measures to determine if the updatedand/or modified decoded route is to be accepted or rejected and a newroute is to be requested.

C. Routes with Additional Traffic Information/Data

In various embodiments, a route may be provided with additional trafficinformation/data. For example, the additional traffic information/datamay include an approximate delay time for traveling along adjacentsegments of a route. For example, the additional trafficinformation/data may give at least a first order detour cost for takinga detour along an adjacent segment of the route. In various embodiments,the additional traffic information/data may be used by a mobileapparatus 20 when assigning a cost value to one or more segments duringthe determination of a decoded route by determining a lowest cost route.In various embodiments, the additional traffic information/data may beused to provide information/data to a user regarding traffic the usermay experience if the user deviates from the route. For example, theadditional traffic information/data may be used to display a trafficheat map (e.g., via the user interface 28). FIG. 9 provides a flowchartillustrating operations performed, such as by the network apparatus 10to provide a route response including additional trafficinformation/data, in accordance with an example embodiment. FIG. 10 is aflowchart illustrating operations performed, such as by the mobileapparatus 20 to decode and use additional traffic information/data, inaccordance with an example embodiment.

i. Exemplary Operation of a Network Apparatus

In various embodiments, a network apparatus may generate and provideadditional traffic information/data as part of a route response forvarious types of route responses. For example, additional trafficinformation/data may be generated and provided along with a shortestdistance, shortest travel time route, and/or the like. Similarly,additional traffic information/data may be generated and provided alongwith a multiple stop route, routes to POIs identified based on aproximity search, a parking cruise route, and/or other routes.

Starting at block 902 of FIG. 9, a route request is received. Forexample, the network apparatus 10 may receive a route request. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, communications interface 16, and/or the like forreceiving a route request. In various embodiments, the route responsemay be a multiple stop route request, POI request, parking cruiserequest, and/or the like. In various embodiments, the route request maycomprise a mobile apparatus identifier identifying the mobile apparatusthat provided the route request, map version agnostic information/dataidentifying a starting location, map version agnostic information/dataidentifying a target location, one or more parameters for the route(e.g., shortest distance, shortest expected travel time, avoid tolls,avoid highways, driving route, biking route, walking route, includedelay bloom filters, and/or the like), and/or the like. In variousembodiments, the information/data identifying the starting location andthe target location are independent of a version of the digital map. Inan example embodiment, the information/data identifying the startinglocation is provided as the midpoint and z-level of a mobile versionsegment corresponding to the current location/position of the mobileapparatus and/or a user provided origin for the route. The midpoint of asegment is the coordinate pair (e.g., latitude and longitude) of thepoint that is approximately halfway down the segment, where the ends ofthe road segment are defined by intersections or nodes. For example, themidpoint of a segment is a point in the middle of the segment betweenthe two intersections that define the ends of the segment. The z-levelof a segment describes the relative location of roads that are stacked.For most segments, the z-level is 0 (e.g., unstacked and/or on groundlevel); however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version segmentcorresponding to a user provided and/or selected destination of theroute and/or a predicted destination of the route. The route request mayinclude various other types of (map version agnostic) information/dataas appropriate for the type of route request (e.g., multiple stop routerequest, POI request, parking cruise request, and/or the like).

At block 904, the route may be determined and a route bloom filterencoding the route segment set defined by the route may be produced. Inthe case where the route request is a multiple stop route request, aplurality of route bloom filters may be produced, with each route bloomfilter encoding a leg of the multiple stop route. For example, thenetwork apparatus 10 may determine a route and produce a route bloomfilter encoding the route segment set defined by the route. For example,the network apparatus 10 may comprise means, such as processor 12,memory 14, and/or the like, for determining a route and producing aroute bloom filter encoding route segment set defined by the route. Forexample, a network version starting segment and network version targetsegment may be identified based on the information/data identifying thestarting location and the target location for the route. A route betweenthe network version starting segment and the network version targetsegment may be determined. The route segment set defined by the routemay then be encoded in a route bloom filter. For example, a route bloomfilter encoding the route segment set defined by the route may beproduced as described above with respect to FIG. 4.

At block 906, traffic information/data may be accessed for one or moredelay segments. As used herein, the term delay segments is used toidentify the set of segments for which additional trafficinformation/data is provided in the route response. In variousembodiments, the delay segments comprise the adjacent segments for theroute. For example, the adjacent segments for a route may be identifiedduring the determination of the route and/or producing of a bloom filterencoding the route segment set defined by the route. In an exampleembodiment, the delay segments further comprise connected segments,wherein connected segments are segments that are directly connected tothe adjacent routes (e.g., share a node or intersection with an adjacentroute) that are not route segments (e.g., not a member of the routesegment set).

In various embodiments, the traffic information/data may be currenttraffic information/data and/or historical/archived trafficinformation/data. In various embodiments, the traffic information/datais current traffic information/data corresponding to real time or nearreal time traffic conditions. In various embodiments, the trafficinformation/data is historical/archived traffic information/dataassociated with an epoch that corresponds to request time. In variousembodiments, an epoch is a particular time period of a day, week, month,year, and/or the like. In various embodiments, the request timecorresponds to the time at which the route is expected to be traversed.For example, if the route is expected to be traversed directly (e.g., assoon as the route is provided to the user and/or the like), the requesttime may be the current time (e.g., the time at which the trafficinformation/data is being accessed). In another example, if the route isexpected to be traversed at a point of time in the future (e.g., asindicated in the route request), the request time may be the time atwhich the route is expected to be traversed (e.g., as indicated in theroute request).

In various embodiments, the accessed traffic information/datacorresponding to each delay segment may correspond to a travel speedalong at least a portion of the corresponding delay segment. Forexample, the accessed traffic information/data may provide arepresentative speed of traffic along the corresponding segment, a freeflow ratio for the segment, a traversal time for the segment and/or thelike based on current probe information/data and/or based onhistorical/archived traffic information/data corresponding to theappropriate epoch for the request time. For example, the networkapparatus 10 may access traffic information/data corresponding to thedelay segments. For example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, communications interface 16,and/or the like, for accessing traffic information/data corresponding tothe delay segments.

At block 908, the delay along each delay segment is determined based onthe corresponding accessed traffic information/data. For example, thenetwork apparatus 10 may determine a delay along each delay segmentbased on the corresponding accessed traffic information/data. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, and/or the like for determining a delay along each delaysegment based on the corresponding accessed traffic information/data. Asused herein the term delay corresponds to the difference in time fortraversing a segment under free flow conditions (e.g., traveling at thespeed limit and/or another free flow speed) and the expected time fortraversing the segment based on the traffic information/data. Forexample, based on the accessed traffic information/data corresponding toa delay segment, an expected time for traversing the delay segment maybe determined. For example, if the accessed traffic information/dataprovides a travel speed along the delay segment, the length of the delaysegment, according to the network version of the digital map, may bedivided by the travel speed along the delay segment to determine theexpected time for traversing the delay segment. The delay for the delaysegment may then be determined by subtracting the time for traversingthe delay segment under free flow conditions (e.g., the length of thesegment divided by the free flow speed for the delay segment) from theexpected time for traversing the delay segment under the current and/orexpected traffic conditions (e.g., based on the trafficinformation/data). For example, the delay for a delay segment may be theadditional number of minutes needed to traverse the segment under thecurrent and/or expected traffic conditions compared to free flowconditions.

At block 910, the delay segments are binned based on the correspondingdelay. For example, a plurality of delay groups may be defined whereeach delay group corresponds to a range of delays. In an exampleembodiment, four delay groups are defined with a first groupcorresponding to delays in a first range (e.g., zero to two minutes), asecond group corresponding to delays in a second range (e.g., threeminutes to eight minutes), a third group corresponding to delays in athird range (e.g., nine minutes to fifteen minutes), and a fourth groupcorresponding to delays in a fourth range (e.g., longer than fifteenminutes). Each delay segment is assigned to a delay group based on thedelay determined for the delay segment. For example, if a first delaydetermined for a first delay segment is one minute and a second delaydetermined for a second delay segment is ten minutes, the first delaysegment is assigned to the first group from the above example (e.g., aone minute delay is within the range of zero to two minutes) and thesecond delay segment is assigned to the third group from the aboveexample. In another example embodiment, three delay groups are definedwith each delay group corresponding to a particular range of delays andthe delay segments are assigned to delay groups based on thecorresponding determined delay. Various numbers of delay groups anddelay ranges may be defined in various embodiments. For example, thenetwork apparatus 10 may assign each delay segment to a delay groupbased on the delay determined for the delay segment being within thedelay range associated with the delay group. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like, for assigning each delay segment to a delay group based on thedelay determined for the delay segment being within the delay rangeassociated with the delay group.

At block 912, a delay bloom filter is produced for each delay group. Forexample, the network apparatus 10 may produce a delay bloom filterencoding each delay group. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, and/or the like forproducing a plurality of delay bloom filters, with each delay bloomfilter encoding a delay group. For example, map version agnostic mapinformation/data for each delay segment may be accessed from the networkversion of the digital map and a map version agnostic identifier foreach delay segment may be generated. The map version agnostic identifierfor each delay segment within a delay group may then be encoded into adelay bloom filter. It may then be determined if any of the delaysegments that were assigned to a different delay group satisfy the delaybloom filter. For example, it may be determined if a second delaysegment assigned to a second group satisfies a first delay bloom filterencoding the map version agnostic identifiers of the delay segmentsassigned to a first group. If the second delay segment assigned to thesecond group satisfies the first delay bloom filter corresponding to thefirst group, the size of the first delay bloom filter may be increased(e.g., from m₁ to m₁+1). For example, a larger first delay bloom filtermay be generated. In an example embodiment, each delay bloom filter maybe incrementally increased in size until the only delay segments thatsatisfy the delay bloom filter are the delay segments assigned to thecorresponding delay group. In an example embodiment, the delay filtersare produced in a manner similar to that described above with respect toFIG. 4.

At block 914, a route response is generated and provided. In variousembodiments, the route response comprises route information/data and thedelay bloom filers. For example, the route information/data may comprisethe route bloom filter(s), information/data identifying a startingsegment of the route, information/data identifying a target segment ofthe route, and/or the like. For example, the network apparatus 10generates and provides a route response including route information/dataand the delay bloom filters. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, communicationsinterface 16, and/or the like, for generating and providing a routeresponse including the route information/data and the delay bloomfilters. For example, the network apparatus 10 may provide (e.g.,transmit) the route response such that the mobile apparatus 20corresponding to the mobile apparatus identifier provided in the routerequest receives the route response. In an example embodiment, the routeand delay bloom filters are provided as an array. For example, the routeresponse may comprise an array populated with the bit arrays of theroute and delay bloom filters. For example, in an embodiment whereinthree delay bloom filters are produced, the array may comprise the routebloom filter in a zeroth position of the array, a first delay bloomfilter corresponding to a first delay range in a first position of thearray, a second delay bloom filter corresponding to a second delay rangein a second position of the array, and a third delay bloom filtercorresponding to a third delay range in a third position of the array.If the ranges of delays are preset, the route response may not includethe ranges of delays and the range of delays corresponding to the delaybloom filters may be determined (e.g., by the mobile apparatus 20) basedon the position of the delay bloom filters within the array provided inthe route response.

ii. Exemplary Operation of a Mobile Apparatus

In various embodiments, a mobile apparatus 20 may receive a routeresponse comprising one or more delay bloom filters (e.g., in additionto a route bloom filter). In various embodiments, the mobile apparatus20 may use the one or more delay bloom filters to determine a delay ordelay range for one or more segments near a route. In variousembodiments, the determined delays and/or delay ranges may be used toprovide a visualization (e.g., via user interface 28) of delays near aroute. In an example embodiment, the determined delays and/or delayranges may be used in the decoding of the route (e.g., to assign costvalues to segments when decoding the route segment set encoded in theroute bloom filter).

Starting at block 1002, a route request is generated and provided suchthat the network apparatus 10 receives the route request. For example,the mobile apparatus 20 may generate and provide (e.g., transmit) aroute request. For example, the mobile apparatus 20 may comprise means,such as processor 22, memory 24, communications interface 26, userinterface 28, location sensor 29, and/or the like, for generating andproviding a route request. In various embodiments, the route request maycomprise a mobile apparatus identifier identifying the mobile apparatus20 that generated and provided the route request, map version agnosticinformation/data identifying a starting location, map version agnosticinformation/data identifying a target location, one or more parametersfor the route (e.g., shortest distance, shortest expected travel time,avoid tolls, avoid highways, driving route, biking route, walking route,include delay bloom filters, and/or the like), and/or the like. Invarious embodiments, the information/data identifying the startinglocation and the target location are independent of a version of thedigital map.

For example, a user may interact with the user interface 28 and requesta route. For example, the user may, operate the user interface 28 toindicate an origin of the route, a destination of the route, and/or oneor more parameters for the route (e.g., shortest distance, shortestexpected travel time, avoid tolls, avoid highway, driving route, bikingroute, walking route, and/or the like). The user may then operate theuser interface 28 to submit the user provided and/or selectedinformation/data and to initiate the generation of the route request. Inan example embodiment, the origin of the route is the current locationof the mobile apparatus 20 as determined by on one or more locationsensors 29 of the mobile apparatus. In another example, a mobileapparatus 20 may determine that the mobile apparatus 20 is moving and/orthat a trip is expected to begin. The mobile apparatus 20 may determinea current location of the mobile apparatus (e.g., via the locationsensor(s) 29) and determine a predicted destination of the route (basedon past trips, information/data stored in a digital calendarcorresponding to a user of the mobile apparatus 20, based on plannedtrips, and/or the like). The mobile apparatus 20 may then automaticallyinitiate the generation of a route request.

As noted above, the mobile apparatus 20 may receive (e.g., via userinterface 28 and/or from location sensor 29) an origin of the route. Themobile apparatus 20 may then map match the origin of the route to asegment of the mobile version of the digital map. This mobile versionstarting segment (e.g., a segment of a mobile version of the digital mapto which the origin has been map-matched) is used to determine the mapversion agnostic information/data identifying the starting location. Inan example embodiment, the information/data identifying the startinglocation is provided as the midpoint and z-level of the mobile versionstarting segment. The midpoint of a segment is the coordinate pair(e.g., latitude and longitude) of the point that is approximatelyhalfway down the segment, where the ends of the road segment are definedby intersections or nodes. For example, the midpoint of a segment is apoint in the middle of the segment between the two intersections thatdefine the ends of the segment. The z-level of a segment describes therelative location of roads that are stacked. For most segments, thez-level is 0 (e.g., unstacked and/or on ground level); however, fortunnels the z-level might be negative and for stacked roads/bridgesz-level might be positive. The mobile apparatus may further map matchthe destination for the route to a segment of the mobile version of thedigital map. This mobile version target segment (e.g., a segment of themobile version of the digital map to which the destination has beenmap-matched) is used to determine the map version agnosticinformation/data identifying the target location. For example, theinformation/data identifying the target location for the route may beprovided as the midpoint and z-level of a mobile version target segment.

At block 1004, a route response is received. For example, the networkapparatus 10 may generate and provide a route response in response tothe route request, and provide the route response such that the mobileapparatus 20 receives the route response. For example, the mobileapparatus 20 may receive the route response. For example, the mobileapparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, and/or the like for receiving the routeresponse. In various embodiments, the route response comprises routeinformation/data and one or more delay bloom filters. For example, invarious embodiments, the route response comprises a route bloom filterand one or more delay bloom filters (e.g., as an array of bit arrays).In an example embodiment, the route response comprises information/dataidentifying a network version starting location and information/dataidentifying a network version target location. In various embodiments,the information/data identifying the network version starting locationand network version target location is map version agnostic. Forexample, in an example embodiment, the information/data identifying thenetwork version starting location is the midpoint of (or other pointalong) the network version starting segment and the z-level of thenetwork version starting segment, and the information/data identifyingthe network version target segment is the midpoint of (or other pointalong) the network version target segment and the z-level of the networkversion target segment. In an example embodiment, the route responseincludes a route length indicating the length (e.g., in miles,kilometers, feet, meters, and/or the like) for the encoded route segmentset.

At block 1006, the route is decoded. For example, the mobile apparatus20 may decode the route segment set encoded by the route bloom filter(s)provided by the route response. For example, the mobile apparatus 20 maycomprise means, such as processor 22, memory 24, and/or the like, fordecoding the route segment set encoded by the route bloom filter(s)provided by the route response.

For example, a decoded starting segment and decoded target segment areidentified. For example, the mobile apparatus 20 may identify and/ordetermine a decoded starting segment and a decoded target segment usingthe mobile version of the digital map. For example, the mobile apparatus20 may comprise means, such as processor 22, memory 24, and/or the like,for identifying and/or determining a decoded starting segment and adecoded target segment using the mobile version of the digital map. Forexample, the map version agnostic information/data identifying thenetwork version starting location may be map-matched using the mobileversion of the digital map to identify a decoded starting segmentcorresponding to the network version starting location. Similarly, themap version agnostic information/data identifying the network versiontarget location may be map-matched using the mobile version of thedigital map to identify a decoded target location corresponding to thenetwork version target location.

In various embodiments, map information/data from the mobile version ofthe digital map for assigning cost values to segments of the mobileversion of the digital map is accessed. For example, the mobileapparatus 20 may access map information/data from a geographic databasestoring map information/data of the mobile version of the digital mapfrom memory 24.

In various embodiments, the cost value assigned to a segment isdetermined based on whether the segment satisfies the route bloom filterand/or one of the delay bloom filters. For example, if a coded mapversion agnostic identifier corresponding to a first segment satisfiesthe route bloom filter, the first segment is assigned a minimal costvalue. For example, the first segment may be assigned a cost value ofzero. However, if the coded map version agnostic identifiercorresponding to the first segment does not satisfy the route bloomfilter, the first segment is assigned a positive cost value (e.g., basedon the length of the segment, expected time of traversal for thesegment, a current or expected traffic level for the segment, a delay ordelay range determined for the segment based on a delay bloom filter,and/or the like). Thus, accessing map information/data for use inassigning cost values to segments further includes accessing mapinformation/data from the mobile version of the digital map that may beused for determining if a segment satisfies the route bloom filterand/or one of the delay bloom filters. For example, a segment recordcorresponding to a segment may be accessed and map version agnosticinformation/data may be extracted therefrom. In an example embodiment,elements of the segment record to be accessed for generating a mapversion agnostic identifier for the segment are pre-established and/ordefined. In particular, the elements of the segment record to beaccessed for use in generating a map version agnostic identifier are thesame elements of the network version of the digital map used by thenetwork apparatus 10 to generate the map version agnostic identifiersthat were coded to produce the route bloom filter(s) and the delay bloomfilters. For example, the map version agnostic identifier may begenerated using a map version agnostic identifier algorithm and themobile apparatus 20 and the network apparatus 10 may use the same mapversion agnostic identifier algorithm. For example, the map versionagnostic map information/data accessed may include a road name, segmentlength, a direction of travel of a segment, a functional class of asegment, speed limit, segment midpoint, and/or the like, in variousembodiments.

The map version agnostic map information/data corresponding to a segmentmay then be used to generate a map version agnostic identifier for thesegment. For example, the accessed map version agnostic information/datacorresponding to a route segment may be combined in a pre-establishedand/or defined manner (e.g., in the same manner as the generation of themap version agnostic identifiers where generated by the networkapparatus 10) to generate a map version agnostic identifier configuredto identify the segment. The map version agnostic identifier may then beused to determine if the corresponding segment satisfies the route bloomfilter and/or one of the delay bloom filters. If the segment satisfiesthe route bloom filter, the segment is assigned a minimal (e.g., zero)cost value. If the segment does not satisfy the route bloom filter, thesegment may be assigned a cost value based on map information/dataand/or a delay or delay range corresponding to one of the delay bloomfilters (e.g., if the segment satisfies the one of the delay bloomfilters). For example, the accessed map information/data may include mapinformation/data that may be used to assign a cost value to a segment ofthe mobile version of the digital map. In an example embodiment, thecost value assigned to a segment may be the length of the segment, theexpected time to traverse the segment, a traffic level indicator, and/orthe like, as described above.

In various embodiments, decoded route is determined by identifying thelowest cost route from the decoded starting segment to the decodedtarget segment is determined. For example, the mobile apparatus 20 maydetermine a decoded route by determining the lowest cost route from thedecoded starting segment to the decoded target segment. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,and/or the like, for determining a decoded route by determining thelowest cost route from the decoded starting segment to the decodedtarget segment. For example, the lowest cost route may be determinedbased on the cost value assigned to segments between the decodedstarting segment and the decoded target segment. In various embodiments,a best-first algorithm may be used to determine the decoded route. In anexample embodiment, a version of Dijkstra's algorithm may be used todetermine the decoded route.

In various embodiments, it is determined if the decoded route satisfiesone or more quality measures. In an example embodiment, the one or morequality measures comprise the length of the decoded route being similarto the route length provided as part of the route response. For example,a decoded route length may be determined and compared to the routelength provided by the route response. In an example embodiment, thedecoded route length is determined by summing the length of each segmentin the decoded route based on the mobile version of the digital map. Forexample, it may be determined if the decoded route length and the routelength satisfy a similarity threshold requirement. In an exampleembodiment, the ratio of the decoded route length and the route lengthmay be compared to a similarity range to determine if the decoded routelength and the route length satisfy a similarity threshold requirement.For example, if the ratio of the decoded route length to the routelength is in within the similarity range, it may be determined that thedecoded route is an acceptable route. If the ratio of the decoded routelength to the route length is not within the similarity range, it may bedetermined that the decoded route is not an acceptable route. In variousembodiments, the similarity range is a predetermined range. In someexample embodiments, the similarity range is 0.7 to 1.3, 0.75 to 1.25,0.8 to 1.2, 0.85 to 1.15, 0.9 to 1.1, and/or 0.95 to 1.05. For example,the mobile apparatus 20 may determine if the decoded route length andthe route length satisfy a similarity threshold requirement. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, and/or the like, for determining if the decoded routelength and the route length satisfy the similarity thresholdrequirement.

In an example embodiment, the one or more quality measures may includedetermining whether the number of elements in the bloom filter that themobile apparatus 20 cannot resolve satisfies a quality thresholdrequirement. When the number of elements of the bloom filter that cannotbe resolved by the mobile apparatus 20 fails to satisfy a qualitythreshold requirement (e.g., exceeds a quality threshold number), it maybe determined that the decoded route fails to satisfy a quality measure.

When it is determined that the decoded route satisfies the one or morequality measures (e.g., the decoded route length and the route lengthsatisfy the similarity threshold requirement), the route is accepted.For example, the mobile apparatus 20 may accept the route and use theroute to complete one or more navigation functions. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, user interface 28, sensors 29, and/or thelike, for (responsive to determining that the decoded route satisfiesthe one or more quality measures) accepting the decoded route and usingthe decoded route to perform one or more navigation functions. Somenon-limiting examples of navigation functions include providing a route(e.g., via a user interface), localization, route determination, lanelevel route determination, operating a vehicle along a lane level route,route travel time determination, lane maintenance, route guidance, lanelevel route guidance, provision of traffic information/data, provisionof lane level traffic information/data, vehicle trajectory determinationand/or guidance, vehicle speed and/or handling control, route and/ormaneuver visualization, and/or the like.

When it is determined that the decoded route does not satisfy at leastone quality measure (e.g., the decoded route length and the route lengthdo not satisfy the similarity threshold requirement), the route isrejected and a new route is requested. For example, the mobile apparatus20 may rejected the route and request a new route. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, and/or the like for (responsive todetermining that the decoded route fails to satisfy at last one qualitymeasure) rejecting the route and requesting a new route. For example,the mobile apparatus 20 may generate an updated and/or modified routerequest and provide (e.g., transmit) the updated and/or modified routerequest such that the network apparatus 10 receives the updated and/ormodified route request. In response to the updated and/or modified routerequest, the network apparatus 10 may generate a new route, encode aroute segment set defined by the same or the new route with a largerroute bloom filter (e.g., a bit array having more bits than thepreviously provided bloom filter) and/or the like. The network apparatus10 may then provide an updated and/or modified route response comprisinga route segment set defined by the new route encoded as a route bloomfilter, a route segment set defined by the previous route encoded with alarger route bloom filter, and/or the like. The mobile apparatus 20receives the updated and/or modified route response and determines anupdated and/or modified decoded route. In an example embodiment, themobile apparatus 20 determines if the updated and/or modified decodedroute satisfies one or more quality measures to determine if the updatedand/or modified decoded route is to be accepted or rejected and a newroute is to be requested.

At block 1008, the adjacent segments for the decoded route areidentified and the corresponding delay bloom filter is identified. Forexample, the mobile apparatus 20 may identify the adjacent segments forthe decoded route and determine the delay bloom filter satisfied by eachof the adjacent segments. For example, the mobile apparatus 20 maycomprise means, such as processor 22, memory 24, and/or the like, foridentifying the adjacent segments for the decoded route and determiningthe delay bloom filter satisfied by each of the adjacent segments. Forexample, the adjacent segments for the decoded route may be identifiedby determining the segments that are defined by and/or that are directlyconnected to the same intersections or nodes as the route segments ofthe decoded route. A map version agnostic identifier for each adjacentsegment may be generated, and the delay bloom filter that the mapversion agnostic identifier satisfies is determined.

At block 1010, the delay range for each adjacent segment for the routeis determined. For example, the mobile apparatus 20 may determine thedelay range for each adjacent segment for the route based on thecorresponding delay bloom filter. For example, the mobile apparatus 20may comprise means, such as processor 22, memory 24, and/or the like,for determining the delay range for each adjacent segment for the routebased on the corresponding delay bloom filter. For example, if a firstadjacent segment for the route satisfies a first delay bloom filter, itis determined that the delay range corresponding to the first adjacentsegment is a first range associated with the first delay bloom filter.In an example embodiment, the route response includes an indication ofthe first range. In an example embodiment, the delay ranges are presetand the position of the first delay bloom filter within the bloom filterarray included in the route response provides an indication of thepresent delay range associated with the first delay bloom filter.

At block 1012, the decoded route and delay information/data is provided.For example, the decoded route and delay information/data may bedisplayed via a display (e.g., of the user interface 28). For example,the mobile apparatus 20 may provide the decoded route and the delayinformation/data. For example, the mobile apparatus 20 may comprisemeans, such as processor 22, memory 24, user interface 28, and/or thelike, for providing the decoded route and delay information/data. Invarious embodiments, the delay information/data may be an indication ofthe delay range associated with one or more adjacent segments for theroute. For example, FIG. 11 provides an example view of an IUI of theuser interface 28 showing the decoded route 1100 from the decodedstarting segment 1102 to the decoded target segment 1104. The adjacentsegments 1110 (e.g., 1110A-E) are displayed in a manner such that thedelay range corresponding to the adjacent segments may be determined.For example, the adjacent segments 1110C and 1110E may be associatedwith the shortest delay range (e.g., zero to five minutes and/or thelike) and may be shown in green and/or another manner that visuallyillustrates that the delay associated with adjacent segments 1110C and1110E is relatively small. For example, the adjacent segments 1110B and1110D may be associated with a middle delay range (e.g., five to tenminutes and/or the like) and may be shown in yellow/orange and/oranother manner that visually illustrates that the delay associated withadjacent segments 1110B and 1110D is a moderate delay. For example, theadjacent segment 1110A may be associated with the longest delay range(e.g., longer than ten minutes, and/or the like) and may be shown in redand/or another manner that visually illustrates that the adjacentsegment 1110A is relatively large. For example, a user may view thedisplay of the decoded route and delay information/data and determine,if the user wishes to take a detour from the decoded route, whichadjacent segments to avoid (e.g., due to long delays along the adjacentsegments) and which adjacent segments are associated with a shorterdelay.

D. POI Proximity Search

In various embodiments, a user may wish to search for POIs near theuser's current location or near a particular location. For example, theuser may wish to find a pizzeria near the user's current location. Theuser may interact with the mobile apparatus 20 (e.g., via the userinterface 28) to request information/data regarding pizzerias nearby.The mobile apparatus 20 may generate a POI route request comprising theuser's location and the query criteria (e.g., pizzeria) and provide thePOI route request such that the network apparatus 10 receives the POIroute request. The network apparatus 10 may identify one or more POIsmeeting the query criteria (e.g., POIs that are associated with POIinformation/data indicating that the POI is a pizzeria) that are nearestthe user's location based on the distance of a route from the user'slocation to the POI, the expected time of travel from the user'slocation to the POI (e.g., based on traffic information/data and/or thelike), and/or the like. The network apparatus 10 may generate a POIroute response including a bloom filter encoding the route segment setdefined by the routes from the user's current location to each of theidentified POIs. The POI route response may also includeinformation/data regarding one or more of the POIs, and/or the like. ThePOI route response may be provided by the network apparatus 10 such thatthe mobile apparatus receives the POI route response. The mobileapparatus 20 may provide the information/data regarding one or more ofthe POIs to the user (e.g., via the user interface 28) and decode aroute to at least one of the one or more POIs (e.g., in response to theuser selecting the at least one POI). FIG. 12 provides a flowchartillustrating operations performed, such as by the network apparatus 10to provide a POI route response, in accordance with an exampleembodiment. FIG. 13 provides a flowchart illustrating operationsperformed, such as by the mobile apparatus 20 to provide a user with aresults of a POI search, in accordance with an example embodiment.

i. Exemplary Operation of a Network Apparatus

Starting at block 1202, a POI request is received. For example, anetwork apparatus 10 may receive a POI request. For example, a networkapparatus 10 may comprise means, such as processor 12, memory 14,communications interface 16, and/or the like for receiving a POIrequest. In various embodiments, the POI request may comprise a mobileapparatus identifier identifying the mobile apparatus that provided theroute request, map version agnostic information/data identifying astarting location, query criteria, one or more parameters for the route(e.g., shortest distance, shortest expected travel time, avoid tolls,avoid highways, driving route, biking route, walking route, additionaltraffic information/data, and/or the like), and/or the like. In variousembodiments, the information/data identifying the starting location isindependent of a version of the digital map. In an example embodiment,the information/data identifying the starting location is provided asthe midpoint and z-level of a mobile version segment corresponding tothe current location/position of the mobile apparatus and/or a userprovided origin for the route. In various embodiments, the querycriteria is an indication of a type of POI the user is interested in,one or more aspects of a POI the user is interested in, and/or the like.For example, the query criteria may indicate that the user is interestedin a pizzeria that is currently open.

At block 1204, the start segment of the network version of the digitalmap is identified. For example, the network apparatus 10 may identifythe starting segment of the network version of the digital map. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, and/or the like for identifying the starting segment ofthe network version of the digital map. For example, theinformation/data identifying the starting location may be map-matched(e.g., using a map matching algorithm, engine, and/or the like) based onthe network version of the digital map to identify the starting segmentof the network version of the digital map. In various embodiments, theinformation/data identifying the starting segment may be map-matched tothe network version of the digital map such that an error up to a preseterror in the matching of the midpoint corresponding to the startinglocation to the midpoint of the corresponding segment of the networkversion of the digital map. The z-level corresponding to the startinglocation may be used for tie breaking in the case where the startinglocation corresponds to a tunnel, bridge, stacked roads, and/or thelike. If the network apparatus cannot exactly match (e.g., within thepreset error) a network version starting segment to the information/dataidentifying the starting location, the POI route response may include aflag indicating such.

At block 1206, a route determination algorithm is initiated at thenetwork version starting segment. For example, the network apparatus 10may initiate a route determination algorithm at the network versionstarting segment. For example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, and/or the like, for initiatinga route determination algorithm at the network version starting segment.For example, the route determination algorithm may be best-firstalgorithm, such as a Dijkstra's algorithm, and/or another costminimization algorithm.

At block 1208, the route determination algorithm is expanded to a newsegment. For example, the network apparatus 10 may expand the routedetermination algorithm to a new segment. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for expanding the route determination to a new segment. Forexample, the route determination algorithm is expanded to a new segmentthat is directly connected to a segment that has already been consideredin the algorithm. For example, two segments are directly connected ifthey are both defined by and/or are directly connected to the sameintersection or node. Thus, when the route determination algorithm isexpended to the new segment, the state of the route determinationalgorithm includes a route from the network version starting segment tothe new segment. In an example embodiment, the route determinationalgorithm does not expand to a new segment if the entirety of the newsegment is further from the network version starting segment than amaximum distance (e.g., user provided maximum distance; maximum distancedetermined based on whether the route is a driving route, walking route,biking route, etc.; and/or the like). The maximum distance may be aEuclidean distance (e.g., as the crow flies) or a graph distance (e.g.,distance along the route from the network version starting segment tothe POI).

At block 1210, it is determined if any POIs that are associated with thenew segment match the query criteria. For example, the POIs associatedwith the new segment may be identified. For example, any POI records inthe geographical database storing the map information/data of thenetwork version of the digital map may be searched (e.g., using asegment identifier configured to identify the new segment) to identifyany POIs associated with the new segment. It may then be determined ifany of the POIs identified as being associated with the new segmentmatch the query criteria. For example, the query criteria may include aPOI type indicating a type of POI to be identified (e.g., coffee shop,restaurant, gas station, grocery store, ice cream shop, and/or thelike), one or more keywords (e.g., pizza, Korean food, self-service gaspumps, and/or the like), a time of interest (e.g., now, 5 pm, etc.), amaximum distance from the start segment and/or a point on the startsegment (e.g., Euclidean distance, graph distance, driving distance,etc.), and/or the like. In an example embodiment, a POI matches thequery criteria if at least one element of the query criteria are met.For example, if the query criteria includes the POI type ice cream shop,than any POI along the new segment associated with the POI type icecream shop may be identified as matching the query criteria. In anexample embodiment, determining whether a POI matches the query criteriamay include determining whether the POI is located with a maximumdistance (e.g., user provided maximum distance; maximum distancedetermined based on whether the route is a driving route, walking route,biking route, etc.; and/or the like). The maximum distance may be aEuclidean distance (e.g., as the crow flies) or a graph distance (e.g.,distance along the route from the starting segment to the POI). In anexample embodiment, a POI matches the query criteria if each element ofthe query criteria are met. For example, if the query criteria includesthe POI type ice cream shop, the keyword strawberry, and a time ofinterest of now, only a POI that is associated with the POI type icecream shop, associated with the keyword strawberry, and is currentlyopen will be identified as matching query criteria. In an exampleembodiment, a POI matches the query criteria if at least one element ofthe POI type or keyword are included in and/or indicated by the POIinformation/data corresponding to the POI and the POI information/dataindicates that the POI is and/or will be open at the time of interest.For example, the network apparatus 10 may determine if any POIsassociated with the new segment match the query criteria. For example,the network apparatus 10 may comprise means, such as processor 12,memory 14, and/or the like, for determining if any POIs associated withthe new segment match the query criteria.

When it is determined that none of the POIs associated with the newsegment match the query criteria, the process returns to block 1208 andthe route determination algorithm is expanded to another new segmentthat is directly connected to segments already considered by the routedetermination algorithm (e.g., directly connected to the previous newsegment).

When it is determined that a POI associated with the new segmentsmatches the query criteria, the process continues to block 1212. Atblock 1212, the identified POI that is associated with the new segmentand matches the query criteria is added to a POI list. The POI listincludes all of the identified POIs corresponding to the POI request. Aroute from the network version starting segment to the identified POI isextracted from a state of the route determination algorithm. Forexample, a shortest distance and/or shortest travel time route from thenetwork version starting segment to the identified POI is extracted froma state of the route determination algorithm. For example, the networkapparatus 10 may add the identified POI (e.g., a POI identifierconfigured to identify the identified POI) to a list of POIscorresponding to the POI request and extract a route from the networkversion starting segment to the identified POI from a state of the routedetermination algorithm. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, and/or the like, foradding the identified POI (e.g., a POI identifier configured to identifythe identified POI) to a list of POIs corresponding to the POI requestand extracting a route from the network version starting segment to theidentified POI from a state of the route determination algorithm. Forexample, the route may be an ordered list of segment identifiersidentifying the route segments extending between the network versionstarting segment and the identified POI.

At block 1214, it is determined if the number of identified POIs in thelist of POIs has reached and/or surpassed a particular number N. Forexample, the POI request may indicate that the particular number N ofPOIs should be returned in response to the request. In another example,the particular number N of POIs may be preset. For example, theparticular number N may be five, ten, fifteen, twenty, and/or the like.For example, the network apparatus 10 may determine if the number ofidentified POIs in the list of POIs has reached and/or surpassed aparticular number N. for example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, and/or the like for determiningwhether the number of identified POIs in the list of POIs has reachedand/or surpassed the particular number N.

In an example embodiment, it may be determined whether all segmentswithin a maximum distance (e.g., Euclidean distance, graph distance,driving distance, and/or the like) have been considered. When it isdetermined that all of the segments within the maximum distance havebeen considered, the process may continue to block 1216, even if thenumber of identified POIs in the list of POIs has not yet reached and/orsurpassed the particular number N. when it is determined that not all ofthe segments within the maximum distance have been considered, theprocess may continue to block 1208.

When it is determined that the number of identified POIs in the list ofPOIs has not yet reached and/or surpassed the particular number N, theprocess returns to block 1208 and the route determination algorithm isexpanded to another new segment that is directly connected to segmentsalready considered by the route determination algorithm (e.g., directlyconnected to the previous new segment).

When it is determined that the number of identified POIs in the list ofPOIs has reached and/or surpassed the particular number N, the processcontinues to block 1216. At block 1216, a bloom filter encoding theroute segment set corresponding to routes from the network versionstarting segment to each of the identified POIs of the POI list isproduced. For example, one route segment set may be defined thatincludes only the route segments of each route from the network versionstarting segment to one of the identified POIs. For example, one bloomfilter may be used to encode the route segment set comprising routesegments of routes to each of the particular number N of identifiedPOIs. For example, map information/data may be accessed from thegeographical database storing map information/data of the networkversion of the digital map such that a map version agnostic identifiermay be generated for each route segment of the routes from the networkversion starting segment to the identified POIs. The map versionagnostic identifiers may be coded (e.g., using k coding functions) andthe resulting coded map version agnostic identifiers are added to thebloom filter. For example, a bloom filter encoding the route segment setdefined by the route segments of each of the routes from the networkversion starting segment to the identified POIs is produced. In anexample embodiment, the bloom filter may be produced in a manner similarto that described with respect to FIG. 4. For example, the networkapparatus 10 may produce a bloom filter encoding the route segment setdefined by the routes from the network version starting segment to eachof the identified POIs. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, and/or the like, forproducing a bloom filter encoding the route segment set defined by theroutes from the network version stating segment to each of theidentified POIs.

At block 1218, a POI route response is generated and provided. Forexample, the network apparatus 10 may generate and provide (e.g.,transmit) a POI route response. For example, the network apparatus 10may comprise means, such as processor 12, memory 14, communicationsinterface 16, and/or the like for generating and providing the POI routeresponse such that the mobile apparatus 20 receives the route response.In various embodiments, the POI route response comprises the bloomfilter (e.g., as a bit array). In an example embodiment, the POI routeresponse comprises information/data identifying a network versionstarting location. In various embodiments, the information/dataidentifying the network version starting location is map versionagnostic. For example, in an example embodiment, the information/dataidentifying the network version starting location is the midpoint of (orother point along) the network version starting segment and the z-levelof the network version starting segment. In various embodiments, the POIroute response includes a POI table or list. In an example embodiment,the POI table or list includes a length of the route from the networkversion starting segment to the corresponding POI, information/dataidentifying the corresponding POI (e.g., name of the POI, a streetaddress for the POI, a geolocation (e.g., latitude and longitude) of thePOI, and/or the like), one or more ratings for the corresponding POI,information/data identifying a target location for each POI, and/or thelike. In an example embodiment, information/data identifying the targetlocation for a POI may be map version agnostic information/dataidentifying the network version segment associated with the POI. Forexample, information/data identifying the target location for a POI maybe a midpoint of (or other point along) the network version targetsegment corresponding to the POI and the z-level of the network versiontarget segment corresponding to the POI.

ii. Exemplary Operation of a Mobile Apparatus

Starting at block 1302, a POI request is generated and provided suchthat the network apparatus 10 receives the POI request. For example, themobile apparatus 20 may generate and provide (e.g., transmit) a POIrequest. For example, the mobile apparatus 20 may comprise means, suchas processor 22, memory 24, communications interface 26, user interface28, location sensor 29, and/or the like, for generating and providing aPOI request.

In various embodiments, the POI request may comprise a mobile apparatusidentifier identifying the mobile apparatus that provided the routerequest, map version agnostic information/data identifying a startinglocation, query criteria, one or more parameters for the route (e.g.,shortest distance, shortest expected travel time, avoid tolls, avoidhighways, driving route, biking route, walking route, additional trafficinformation/data, and/or the like), and/or the like. In variousembodiments, the information/data identifying the starting location isindependent of a version of the digital map. In an example embodiment,the information/data identifying the starting location is provided asthe midpoint and z-level of a mobile version segment corresponding tothe current location/position of the mobile apparatus and/or a userprovided origin for the route. In various embodiments, the querycriteria is an indication of a type of POI the user is interested in,one or more aspects of a POI the user is interested in, and/or the like.For example, the query criteria may indicate that the user is interestedin a pizzeria that is currently open.

For example, a user may interact with the user interface 28 and requesta POI search. For example, the user may, operate the user interface 28to indicate (e.g., provide, select, and/or the like) an origin of thesearch, one or more elements of query criteria (e.g., a POI type,keyword(s), time of interest, and/or the like), and/or one or moreparameters for the route (e.g., shortest distance, shortest expectedtravel time, avoid tolls, avoid highway, driving route, biking route,walking route, and/or the like). The user may then operate the userinterface 28 to submit the user provided and/or selectedinformation/data and to initiate the generation of the POI request. Inan example embodiment, the origin of the route is the current locationof the mobile apparatus 20 as determined by one or more location sensors29 of the mobile apparatus.

As noted above, the mobile apparatus 20 may receive (e.g., via userinterface 28 and/or from location sensor 29) an origin of the POIsearch. The mobile apparatus 20 may then map match the origin of the POIsearch to a segment of the mobile version of the digital map. Thismobile version starting segment (e.g., a segment of a mobile version ofthe digital map to which the origin has been map-matched) is used todetermine the map version agnostic information/data identifying thestarting location. In an example embodiment, the information/dataidentifying the starting location is provided as the midpoint andz-level of the mobile version starting segment. The midpoint of asegment is the coordinate pair (e.g., latitude and longitude) of thepoint that is approximately halfway down the segment, where the ends ofthe road segment are defined by intersections or nodes. For example, themidpoint of a segment is a point in the middle of the segment betweenthe two intersections that define the ends of the segment. The z-levelof a segment describes the relative location of roads that are stacked.For most segments, the z-level is 0 (e.g., unstacked and/or on groundlevel); however, for tunnels the z-level might be negative and forstacked roads/bridges z-level might be positive.

At block 1304, a POI route response is received. For example, thenetwork apparatus 10 may generate and provide a POI route response, inresponse to the POI request, and provide the POI route response suchthat the mobile apparatus 20 receives the POI route response. Forexample, the mobile apparatus 20 may receive the POI route response. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, communications interface 26, and/or the like forreceiving the POI route response. In various embodiments, the POI routeresponse comprises bloom filter (e.g., as a bit array) encoding a routesegment set defined by routes from the network version starting segmentto each of the POIs identified in the POI search. In an exampleembodiment, the POI route response comprises information/dataidentifying a network version starting location. In various embodiments,the information/data identifying the network version starting locationis map version agnostic. For example, in an example embodiment, theinformation/data identifying the network version starting location isthe midpoint of (or other point along) the network version startingsegment and the z-level of the network version starting segment. Invarious embodiments, the POI route response includes a POI table orlist. In an example embodiment, the POI table or list includes a lengthof the route from the network version starting segment to thecorresponding POI, information/data identifying the corresponding POI(e.g., name of the POI, a street address for the POI, a geolocation(e.g., latitude and longitude) of the POI, and/or the like), one or moreratings for the corresponding POI, information/data identifying a targetlocation for each POI, and/or the like. In an example embodiment,information/data identifying the target location for a POI may be mapversion agnostic information/data identifying the network versionsegment associated with the POI. For example, information/dataidentifying the target location for a POI may be a midpoint of (or otherpoint along) the network version target segment corresponding to the POIand the z-level of the network version target segment corresponding tothe POI.

At block 1306, a decoded starting segment and decoded target segment foreach POI of the POI table or list are identified. For example, themobile apparatus 20 may identify and/or determine a decoded startingsegment and a decoded target segment for each POI using the mobileversion of the digital map. For example, the mobile apparatus 20 maycomprise means, such as processor 22, memory 24, and/or the like, foridentifying and/or determining a decoded starting segment and a decodedtarget segment for each POI using the mobile version of the digital map.For example, the map version agnostic information/data identifying thenetwork version starting location may be map-matched using the mobileversion of the digital map to identify a decoded starting segmentcorresponding to the network version starting location. Similarly, themap version agnostic information/data identifying the network versiontarget location for each POI of the POI table or list may be map-matchedusing the mobile version of the digital map to identify a decoded targetlocation corresponding to the network version target location for eachPOI.

At block 1308, map information/data is accessed from the mobile versionof the digital map for assigning cost values to segments of the mobileversion of the digital map. For example, the mobile apparatus 20 mayaccess map information/data from a geographic database storing mapinformation/data of the mobile version of the digital map from memory24.

In various embodiments, the cost value assigned to a segment isdetermined based on whether the segment satisfies the bloom filter. Forexample, if a coded map version agnostic identifier corresponding to afirst segment satisfies the bloom filter, the first segment is assigneda minimal cost value. For example, the first segment may be assigned acost value of zero. However, if the coded map version agnosticidentifier corresponding to the first segment does not satisfy the bloomfilter, the first segment is assigned a positive cost value (e.g., basedon the length of the segment, expected time of traversal for thesegment, a current or expected traffic level for the segment, and/or thelike). Thus, accessing map information/data for use in assigning costvalues to segments further includes accessing map information/data fromthe mobile version of the digital map that may be used for determiningif a segment satisfies the bloom filter. For example, a segment recordcorresponding to a segment may be accessed and map version agnosticinformation/data may be extracted therefrom. In an example embodiment,elements of the segment record to be accessed for generating a mapversion agnostic identifier for the segment are pre-established and/ordefined. In particular, the elements of the segment record to beaccessed for use in generating a map version agnostic identifier are thesame elements of the network version of the digital map used by thenetwork apparatus to generate the map version agnostic identifiers thatwere coded to produce the bloom filter. For example, the map versionagnostic identifier may be generated using a map version agnosticidentifier algorithm and the mobile apparatus 20 and the networkapparatus 10 may use the same map version agnostic identifier algorithm.For example, the map version agnostic map information/data accessed mayinclude a road name, segment length, a direction of travel of a segment,a functional class of a segment, speed limit, segment midpoint, and/orthe like, in various embodiments.

The map version agnostic map information/data corresponding to a segmentmay then be used to generate a map version agnostic identifier for thesegment. For example, the accessed map version agnostic information/datacorresponding to a segment may be combined in a pre-established and/ordefined manner (e.g., in the same manner as the generation of the mapversion agnostic identifiers where generated by the network apparatus10) to generate a map version agnostic identifier configured to identifythe segment. The map version agnostic identifier may then be used todetermine if the corresponding segment satisfies the bloom filter. Ifthe segment satisfies the bloom filter, the segment is assigned aminimal (e.g., zero) cost value. If the segment does not satisfy thebloom filter, the segment may be assigned a cost value based on mapinformation/data. For example, the accessed map information/data mayinclude map information/data that may be used to assign a cost value toa segment of the mobile version of the digital map. In an exampleembodiment, the cost value assigned to a segment may be the length ofthe segment, the expected time to traverse the segment, a traffic levelindicator, and/or the like, as described above.

In an example embodiment, block 1308 may be performed concurrently withblock 1310 such that the map information/data for assigning a cost valueto a first segment is accessed when a route determining algorithm isexpanded to the first segment. For example, map information/data forassigning a cost value to a first segment may be accessed and the costvalue assigned to the first segment based thereon, in response to aroute determining algorithm considering whether the first segment ispart of the decoded route.

At block 1310, a decoded route for each POI of the POI table or list isdetermined by identifying the lowest cost route from the decodedstarting segment to the decoded target segment corresponding to the POIis determined. For example, the mobile apparatus 20 may determine adecoded route to each of the POIs of the POI table or list bydetermining the lowest cost route from the decoded starting segment tothe decoded target segment corresponding to the POI. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,and/or the like, for determining a decoded route by determining thelowest cost route to each of the POIs of the POI table or list from thedecoded starting segment to the decoded target segment corresponding tothe POI. For example, the lowest cost route corresponding to a POI maybe determined based on the cost value assigned to segments between thedecoded starting segment and the decoded target segment corresponding tothe POI. In various embodiments, a best-first algorithm may be used todetermine the decoded route. In an example embodiment, a version ofDijkstra's algorithm may be used to determine the decoded route.

In various embodiments, the POI table and/or list includesinformation/data regarding a particular number N POIs. In an exampleembodiment, a decoded route is determined to each of the particularnumber N POIs. For example, N routes may be decoded based on the bloomfilter. In an example embodiment, the POIs may be presented to the user(e.g., via the user interface 28) prior to determining the decodedroute(s) and a decoded route is determined responsive to receiving userinput selecting one of the POIs from the particular number N POIs. Insuch an embodiment, a decoded route may only be determined for theuser-selected POI.

At block 1312, it is determined if the decoded routes satisfy one ormore quality measures. In an example embodiment, the one or more qualitymeasures comprise the length of a first decoded route corresponding to afirst POI being similar to the route length provided as part of the POItable or list corresponding to the first POI. For example, a decodedroute length corresponding to a first POI may be determined and comparedto the route length provided by the POI route response corresponding tothe first POI. In an example embodiment, the decoded route length isdetermined by summing the length of each segment in the decoded routebased on the mobile version of the digital map. For example, it may bedetermined if the decoded route length and the route lengthcorresponding to the same POI satisfy a similarity thresholdrequirement. In an example embodiment, the ratio of the decoded routelength and the route length may be compared to a similarity range todetermine if the decoded route length and the route length satisfy asimilarity threshold requirement. For example, if the ratio of thedecoded route length to the route length corresponding to the same POIis in within the similarity range, it may be determined that the decodedroute is an acceptable route. If the ratio of the decoded route lengthto the route length corresponding to the same POI is not within thesimilarity range, it may be determined that the decoded route is not anacceptable route. In various embodiments, the similarity range is apredetermined range. In some example embodiments, the similarity rangeis 0.7 to 1.3, 0.75 to 1.25, 0.8 to 1.2, 0.85 to 1.15, 0.9 to 1.1,and/or 0.95 to 1.05. For example, the mobile apparatus 20 may determineif the decoded route length corresponding to the first POI and the routelength corresponding to the first POI satisfy a similarity thresholdrequirement. For example, the mobile apparatus 20 may comprise means,such as processor 22, memory 24, and/or the like, for determining if thedecoded route length and the route length corresponding to the same POIsatisfy the similarity threshold requirement.

In an example embodiment, the one or more quality measures may includedetermining whether the number of elements in the bloom filter that themobile apparatus 20 cannot resolve satisfies a quality thresholdrequirement. When the number of elements of the bloom filter that cannotbe resolved by the mobile apparatus 20 fails to satisfy a qualitythreshold requirement (e.g., exceeds a quality threshold number), it maybe determined that the decoded route fails to satisfy a quality measure.

When it is determined that the decoded route satisfies the one or morequality measures (e.g., the decoded route length corresponding to a POIand the route length corresponding to the POI satisfy the similaritythreshold requirement) for each POI, the process continues to block 1314and information/data regarding one or more POIs of the POI table or listis provided to a user of the mobile apparatus 20 (e.g., via the userinterface 28). For example, the mobile apparatus 20 may provideinformation/data regarding one or more POIs of the POI table or list toa user. For example, the mobile apparatus 20 may comprise means, such asprocessor 22, memory 24, communications interface 26, user interface 28,sensors 29, and/or the like, for (responsive to determining that thedecoded route satisfies the one or more quality measures) providinginformation/data regarding one or more POIs of the POI table or list toa user. In an example embodiment, the mobile apparatus 20 may filter thePOIs provided to the user based on distance from the user's location.For example, the decoded route length corresponding to a POI and/or theroute length corresponding to the POI (e.g., provided as part of the POIroute response) may be used to filter the POIs provided to the userbased on a distance criteria (e.g., Euclidean distance, graph distance,driving distance, and/or the like).

FIG. 14 provides an example POI search result IUI 1400 provided via auser interface 28, in an example embodiment. The POI search result IUI1400 comprises a map portion 1402, showing the location of one or morePOIs of the POI table or list based on map visualizationinformation/data of the mobile version of the digital map. For example,a POI location indicator 1408 may indicate the location of a POI on themap. For example, a user location indicator 1406 may indicate thecurrent location of the mobile apparatus 20 on the map. In an exampleembodiment, the POI search result IUI 1400 comprises a POI resultslisting portion 1404. In an example embodiment, the POI results listingportion 1404 provides an overview of information/data regarding one ormore POIs of the POI table or list. For example, the overview ofinformation/data regarding one or more POIs may include a POI name(e.g., the name of an establishment or other POI), a cost levelindicator, a rating, a travel distance of the corresponding (decoded)route, a travel time of the corresponding (decoded) route, and/or thelike, for each of the one or more POIs. In an example embodiment, a usermay select a first POI from the one or more POIs by selecting theinformation/data regarding the first POI in the POI results listingportion 1404 and/or by selecting the POI location indicator 1408 of themap portion 1402 of the POI search result IUI 1400.

Responsive to receiving user input selecting one of the one or morePOIs, the mobile apparatus 20 may use the decoded route corresponding tothe user-selected POI to perform one or more navigation functions. Somenon-limiting examples of navigation functions include providing a route(e.g., via a user interface), localization, route determination, lanelevel route determination, operating a vehicle along a lane level route,route travel time determination, lane maintenance, route guidance, lanelevel route guidance, provision of traffic information/data, provisionof lane level traffic information/data, vehicle trajectory determinationand/or guidance, vehicle speed and/or handling control, route and/ormaneuver visualization, and/or the like.

When it is determined that at least one of decoded routes does notsatisfy at least one quality measure (e.g., the decoded route length andthe route length corresponding to the same POI do not satisfy thesimilarity threshold requirement), the process continues to block 1316of FIG. 13. At block 1316, the at least one route is rejected and a newPOI route response is requested. For example, the mobile apparatus 20may rejected the route and request a new POI route response. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, communications interface 26, and/or the like for(responsive to determining that the decoded route fails to satisfy atlast one quality measure) rejecting the route and requesting a new POIroute response. For example, the mobile apparatus 20 may generate anupdated and/or modified POI request and provide (e.g., transmit) theupdated and/or modified POI request such that the network apparatus 10receives the updated and/or modified POI request. In response to theupdated and/or modified POI request, the network apparatus 10 maygenerate a new route to at least one POI, encode a route segment setdefined by the same set of routes or the new or modified set of routeswith a larger bloom filter (e.g., a bit array having more bits than thepreviously provided bloom filter) and/or the like. The network apparatus10 may then provide an updated and/or modified POI route responsecomprising the new bloom filter, and/or the like. The mobile apparatus20 receives the updated and/or modified POI route response anddetermines an updated and/or modified decoded route to at least one POI.In an example embodiment, the mobile apparatus 20 determines if theupdated and/or modified decoded route to the at least one POI satisfiesone or more quality measures to determine if the updated and/or modifieddecoded route is to be accepted or rejected and another updated and/ormodified POI request is to be generated and provided.

E. Parking Cruise Route

In various embodiments, a user may interact with a mobile apparatus 20(e.g., via the user interface 28) to request a parking cruise route. Inan example embodiment, the mobile apparatus 20 may automatically requesta parking cruise route when the mobile apparatus 20 is approaching thedestination of a route. In various embodiments, a parking cruise routeis a route along which it is expected that parking may be found. Invarious embodiments, a parking cruise route is a route along which it isexpected that on-road parking may be found. In an example embodiment, itis expected that parking will be found along the parking cruise routewithin a maximum distance of a destination, maximum walking time fromthe destination, maximum cruising time, and/or the like. FIG. 15provides a flowchart illustrating operations performed, such as by thenetwork apparatus 10 to provide a parking cruise route response, inaccordance with an example embodiment. FIG. 16 provides a flowchartillustrating operations performed, such as by the mobile apparatus 20 todecode and use a parking cruise route, in accordance with an exampleembodiment.

i. Exemplary Operation of a Network Apparatus

Starting at block 1502 of FIG. 15, a parking cruise request is received.For example, a network apparatus 10 may receive a parking cruiserequest. For example, a network apparatus 10 may comprise means, such asprocessor 12, memory 14, communications interface 16, and/or the likefor receiving a parking cruise request. In various embodiments, theparking cruise request may comprise a mobile apparatus identifieridentifying the mobile apparatus that provided the route request, aparking time (e.g., the time at which parking is desired), map versionagnostic information/data identifying a starting location, a maximumdistance from a destination, a maximum walking time from a destination,a maximum cruising time (e.g., time expected for a parking spot to befound), a destination near which parking is desired, and/or the like. Invarious embodiments, the information/data identifying the startinglocation is independent of a version of the digital map. In an exampleembodiment, the information/data identifying the starting location isprovided as the midpoint and z-level of a mobile version segmentcorresponding to the current location/position of the mobile apparatusand/or a user provided origin for the route. In various embodiments, thedestination near which the user would like to park is provided in a mapversion agnostic manner. For example, the destination may be provided asgeolocation (e.g., latitude and longitude).

At block 1504, the network version start segment is identified. Forexample, the network apparatus 10 may identify the network versionstarting segment. For example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, and/or the like for identifyingthe network version starting segment. For example, the information/dataidentifying the starting location may be map-matched (e.g., using a mapmatching algorithm, engine, and/or the like) based on the networkversion of the digital map to identify the network version startingsegment. In various embodiments, the information/data identifying thestarting location may be map-matched to the network version of thedigital map such that an error up to a preset error in the matching ofthe midpoint corresponding to the starting location to the midpoint ofthe corresponding segment of the network version of the digital map istolerated. The z-level corresponding to the starting location may beused for tie breaking in the case where the starting locationcorresponds to a tunnel, bridge, stacked roads, and/or the like. If thenetwork apparatus cannot exactly match (e.g., within the preset error) anetwork version starting segment to the information/data identifying thestarting location, the POI route response may include a flag indicatingsuch.

At block 1506, parking information/data and traffic information/data forsegments in the vicinity of the destination are accessed. For example,parking and traffic information/data may be accessed (e.g., from ageographic database stored in the memory 14 that stores mapinformation/data corresponding to a network version of a digital map)for segments within the maximum distance from the destination. Forexample, the network apparatus 10 may access parking and trafficinformation/data for segments in the vicinity of the destination. Forexample, the network apparatus 10 may comprising means, such asprocessor 12, memory 14, communications interface 16, and/or the like,for accessing parking and traffic information/data for segments in thevicinity of the destination. For example, the parking information/datamay indicate the probability of finding parking (e.g., on-road parking)on the corresponding segment during a particular epoch (e.g., timewindow of a day, week, month, year, and/or the like). In an exampleembodiment, the traffic information/data may provide a travel speedand/or indication thereof (e.g., free flow ratio, and/or the like) alongthe corresponding segment during a particular epoch. The parking and/ortraffic information/data may be accessed corresponding to a particularepoch that corresponds to the parking time. In various embodiments, avariety of other information/data regarding the segments within thevicinity of the destination may be accessed from the network version ofthe digital map, including, for example, a segment length.

At block 1508, a route determination algorithm is imitated at thenetwork version starting segment. For example, the network apparatus 10may initiate a route determination algorithm at the network versionstarting segment. For example, the network apparatus 10 may comprisemeans, such as processor 12, memory 14, and/or the like, for initiatinga route determination algorithm at the network version starting segment.For example, the route determination algorithm may be best-firstalgorithm, such as a Dijkstra's algorithm, and/or the like. In variousembodiments, the route determination algorithm is configured to find alowest cost route.

At block 1510, the route determination algorithm is expanded to a newsegment. For example, the network apparatus 10 may expand the routedetermination algorithm to a new segment. For example, the networkapparatus 10 may comprise means, such as processor 12, memory 14, and/orthe like for expanding the route determination to a new segment. Forexample, the route determination algorithm is expanded to a new segmentthat is directly connected to a segment that has already been consideredin the algorithm. For example, two segments are directly connected ifthey are both defined by and/or are directly connected to the sameintersection or node. Thus, when the route determination algorithm isexpended to the new segment, the state of the route determinationalgorithm includes a route from the network version starting segment tothe new segment.

At block 1512, it is determined if the cost of traversing a route fromthe network version starting segment to the new segment is greater thana maximum cost value. In an example embodiment, the maximum cost valueis the maximum distance from the destination and the cost of traversinga first segment is the length of the segment. In an example embodiment,the maximum cost value is the expected time before finding parking whentraversing the route from the network version starting segment to thenew segment. For example, the cost for traversing a first segment may be

${\frac{\ell}{\left( {\min\left( {v_{c},v_{t}} \right)} \right)}*\left( {1 - P} \right)},$where

is the length of the first segment, P is probability of finding parkingalong the first segment at the parking time (e.g., the time that it isexpected the user will be seeking parking), v_(c) is a cruising capspeed (e.g., the speed it is expected a user would drive when searchingfor a parking spot) and v_(t) is the traffic speed along the firstsegment at the parking time. For example, P may be determined based onthe accessed parking information/data corresponding to the first segmentand v_(t) may be determined based on the accessed trafficinformation/data corresponding to the first segment. For example, thecost of a route may be determined by summing the cost value for eachsegment of the route. For example, the network apparatus 10 maydetermine if the cost of traversing a route from the network versionstarting segment to the new segment is greater than the maximum cost.For example, the network apparatus 10 may comprise means, such asprocessor 12, memory 14, and/or the like, for determining whether thecost of traversing a route from the network version starting segment tothe new segment is greater than the maximum cost. In variousembodiments, the maximum cost may be determined based on an element ofthe parking cruise request or may be a predetermined value.

When it is determined that the cost of traversing the route from thenetwork version starting segment to the new segment is greater than themaximum cost, the process returns to block 1508 and the routedetermination begins another exploration of the map starting at thenetwork version starting segment. In particular, if the cost oftraversing the route from the network version starting segment to thenew segment is greater than the maximum cost, it is expected thatparking will not be found along the route within the maximum distance ofthe destination, within a maximum walking time from the destination, orwithin a maximum cruising time. The route determination algorithm willthen attempt to find a new route with a higher probability of parking.

When it is determined that the cost of traversing the route from thenetwork version starting segment to the new segment is not greater thanthe maximum cost, the process continues to block 1514. At block 1514, itis determined whether the probability of finding parking along the routefrom the network version starting segment to the new segment isapproximately one hundred percent. For example, the network apparatus 10may determine if it is likely that parking will be found along the routefrom the network version starting segment to the new segment. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, and/or the like, for determining whether it is likelythat parking will be found along the route from the network versionstarting segment to the new segment. For example, it may be determinedif the likelihood that parking will be found along the route from thenetwork version starting segment to the new segment (during theparticular epoch) satisfies a threshold probability requirement. In anexample embodiment, a route satisfies a threshold probabilityrequirement when the likelihood that parking will be found along theroute exceeds a threshold probability. In various embodiments, thethreshold probability is 80%, 85%, 90%, 95%, 99%, and/or the like.

When it is determined that the route from the network version startingsegment to the new segment does not satisfy the threshold probabilityrequirement, the process returns to block 1510 and the routedetermination algorithm is expanded to another new segment that isdirectly connected to segments already considered by the routedetermination algorithm (e.g., directly connected to the previous newsegment).

When it is determined that the route from the network version startingsegment to the new segment does satisfy the threshold probabilityrequirement, the new segment is set as the network version targetsegment for the parking cruise route and the process continues to block1516. At block 1516, the parking cruise route is extracted from a stateof the route determination algorithm. For example, the route from thenetwork version starting segment to the new segment is extracted fromthe state of the route determination algorithm as the parking cruiseroute. For example, the network apparatus 10 may extract the route fromthe network version starting segment to the new segment is extractedfrom the state of the route determination algorithm as the parkingcruise route. For example, the network apparatus 10 may comprise means,such as processor 12, memory 14, and/or the like for extracting routefrom the network version starting segment to the new segment isextracted from the state of the route determination algorithm as theparking cruise route. A route segment set is defined based one theparking cruise route and the route segments thereof.

At block 1518, a bloom filter encoding the route segment set defined bythe parking cruise route is produced. For example, the network apparatus10 may produce a bloom filter encoding the route segment set defined bythe parking cruise route. For example, the network apparatus 10 maycomprise means, such as processor 12, memory 14, and/or the like, forproducing a bloom filter encoding the route segment set defined by theparking cruise route. For example, map version agnostic identifiers maybe generated for each route segment of the parking cruise route. The mapversion agnostic identifiers of the route segments may then be coded(e.g., using the k coding functions) and used to build a bloom filter.The bloom filter may then be tested to ensure that none of the adjacentsegments of the parking cruise route satisfy the bloom filter. Forexample, a bloom filter encoding the route segment set for the parkingcruise route may be produced as described above with respect to FIG. 4.

At block 1520, a parking cruise route response may be generated andprovided. In an example embodiment, the parking cruise route responseincludes the bloom filter encoding the route segment set defined by theparking cruise route. For example, the network apparatus 10 may generateand provide a parking cruise route response including the bloom filterencoding the route segment set defined by the parking cruise route. Forexample, the network apparatus 10 may comprise means, such as processor12, memory 14, communications interface 16, and/or the like forgenerating and providing (e.g., transmitting) a parking cruise routeresponse including the bloom filter encoding the route segment setdefined by the parking cruise route. In an example embodiment, theparking cruise route response may further include a route length of theparking cruise route, information/data identifying a network versionstarting location of the route, information/data identifying a networkversion target location of the route, and/or the like. As should beunderstood, the information/data identifying the network versionstarting and target locations of the parking cruise route is map versionagnostic. For example, in an example embodiment, the information/dataidentifying the network version starting location is the midpoint of (orother point along) the network version starting segment and the z-levelof the network version starting segment, and the information/dataidentifying the network version target segment is the midpoint of (orother point along) the network version target segment and the z-level ofthe network version target segment. In various embodiments, the parkingcruise route response is provided such that the mobile apparatus 20 thatprovided the parking cruise request (e.g., as indicated by the mobileapparatus identifier provided in the parking cruise request) receivesthe parking cruise route response.

ii. Exemplary Operation of a Mobile Apparatus

Starting at block 1602 of FIG. 16, a parking cruise request is generatedand provided such that the network apparatus 10 receives the parkingcruise request. For example, the mobile apparatus 20 may generate andprovide (e.g., transmit) a parking cruise request. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, user interface 28, location sensor 29,and/or the like, for generating and providing a parking cruise request.In various embodiments, the parking cruise request may comprise a mobileapparatus identifier identifying the mobile apparatus 20, map versionagnostic information/data identifying a starting location, a maximumdistance from a destination, a maximum walking time from a destination,a maximum cruising time (e.g., time expected for a parking spot to befound), a destination near which parking is desired, a parking time(e.g., the time at which parking is desired), and/or the like. Invarious embodiments, the information/data identifying the startinglocation is independent of a version of the digital map. In an exampleembodiment, the information/data identifying the starting location isprovided as the midpoint and z-level of a mobile version segmentcorresponding to the current location/position of the mobile apparatusand/or a user provided origin for the route. In various embodiments, thedestination near which the user would like to park is provided in a mapversion agnostic manner. For example, the destination may be provided asgeolocation (e.g., latitude and longitude), address (e.g., a streetaddress), a street name, a POI name (e.g., city hall, Aden's Famous IceCream), and/or the like.

For example, a user may interact with the user interface 28 and requesta parking cruise route. For example, the user may, operate the userinterface 28 to indicate (e.g., provide, select, and/or the like) adestination near which parking is desired, a maximum distance from adestination, a maximum walking time from a destination, a maximumcruising time (e.g., time expected for a parking spot to be found), aparking time, and/or the like. The user may then operate the userinterface 28 to submit the user provided and/or selectedinformation/data and to initiate the generation of the parking cruiserequest. In an example embodiment, the origin of the route is thecurrent location of the mobile apparatus 20 as determined by one or morelocation sensors 29 of the mobile apparatus. In an example, embodiment,one or more of the parking time, maximum distance from a destination, amaximum walking time from a destination, or a maximum cruising time(e.g., time expected for a parking spot to be found) may beautomatically determined based on user preferences (e.g., stored in auser profile corresponding to the user or stored by the mobile apparatus20). In an example embodiment, the mobile apparatus 20 may automaticallygenerate and provide (e.g., transmit) a parking cruise request when themobile apparatus 20 is approaching a destination (e.g., without userinput or only with user input confirming that a parking cruise requestshould be generated). For example, the mobile apparatus 20 (e.g., basedon location information/data determined by location sensor 29) maydetermine that the mobile apparatus 20 is within a threshold distanceand/or a threshold travel time of the destination and, responsivethereto, generate and provide a parking cruise request.

As noted above, the mobile apparatus 20 may receive (e.g., via userinterface 28 and/or from location sensor 29) an origin of the parkingcruise route. The mobile apparatus 20 may then map match the origin ofthe parking cruise route to a segment of the mobile version of thedigital map. This mobile version starting segment (e.g., a segment of amobile version of the digital map to which the origin has beenmap-matched) is used to determine the map version agnosticinformation/data identifying the starting location. In an exampleembodiment, the information/data identifying the starting location isprovided as the midpoint and z-level of the mobile version startingsegment. The midpoint of a segment is the coordinate pair (e.g.,latitude and longitude) of the point that is approximately halfway downthe segment, where the ends of the road segment are defined byintersections or nodes. For example, the midpoint of a segment is apoint in the middle of the segment between the two intersections thatdefine the ends of the segment. The z-level of a segment describes therelative location of roads that are stacked. For most segments, thez-level is 0 (e.g., unstacked and/or on ground level); however, fortunnels the z-level might be negative and for stacked roads/bridgesz-level might be positive.

At block 1604, a parking cruise route response is received. For example,the network apparatus 10 may generate and provide a parking cruise routeresponse, in response to the parking cruise request, and provide theparking cruise route response such that the mobile apparatus 20 receivesthe parking cruise route response. For example, the mobile apparatus 20may receive the parking cruise route response. For example, the mobileapparatus 20 may comprise means, such as processor 22, memory 24,communications interface 26, and/or the like for receiving the parkingcruise route response. In an example embodiment, the parking cruiseroute response includes a bloom filter (e.g., as a bit array) encodingthe route segment set defined by the parking cruise route determined bythe network apparatus 10. In an example embodiment, the parking cruiseroute response may further include a route length of the parking cruiseroute, information/data identifying a network version starting locationof the route, information/data identifying a network version targetlocation of the route, and/or the like. As should be understood, theinformation/data identifying the network version starting and targetlocations of the parking cruise route is map version agnostic. Forexample, in an example embodiment, the information/data identifying thenetwork version starting location is the midpoint of (or other pointalong) the network version starting segment and the z-level of thenetwork version starting segment, and the information/data identifyingthe network version target segment is the midpoint of (or other pointalong) the network version target segment and the z-level of the networkversion target segment.

At block 1606, a decoded starting segment and decoded target segment forthe parking cruise route are identified. For example, the mobileapparatus 20 may identify and/or determine a decoded starting segmentand a decoded target segment for the parking cruise route using themobile version of the digital map. For example, the mobile apparatus 20may comprise means, such as processor 22, memory 24, and/or the like,for identifying and/or determining a decoded starting segment and adecoded target segment for the parking cruise route using the mobileversion of the digital map. For example, the map version agnosticinformation/data identifying the network version starting location maybe map-matched using the mobile version of the digital map to identify adecoded starting segment corresponding to the network version startinglocation. Similarly, the map version agnostic information/dataidentifying the network version target location may be map-matched usingthe mobile version of the digital map to identify a decoded targetlocation corresponding to the network version target location.

At block 1608, traffic and/or parking information/data is accessed. Forexample, the mobile apparatus 20 may access traffic and/or parkinginformation/data. For example, the network apparatus 20 may comprisemeans, such as processor 22, memory 24, and/or the like, for accessingtraffic and/or parking information/data. In various embodiments, thetraffic and/or parking information/data is accessed for segments nearand/or between the decoded starting segment and the decoded targetsegment for an epoch corresponding to the parking time. For example, theparking information/data may indicate the probability of finding parking(e.g., on-road parking) on the corresponding segment during a particularepoch (e.g., time window of a day, week, month, year, and/or the like)corresponding to the parking time. In an example embodiment, the trafficinformation/data may provide a travel speed and/or indication thereof(e.g., free flow ratio, and/or the like) along the corresponding segmentduring a particular epoch corresponding to the parking time. In variousembodiments, the traffic and/or parking information/data is accessedfrom a geographic database (e.g., stored in memory 24) storing mapinformation/data of the mobile version of the digital map. For example,the traffic and/or parking information/data accessed for a first segmentmay include P, the probability of finding parking along the firstsegment during an epoch corresponding to the parking time (e.g., thetime that it is expected the user will be seeking parking), and v_(t),the traffic speed along the first segment during an epoch correspondingto the parking time.

At block 1610, map information/data from the mobile version of thedigital map for generating map version agnostic identifiers for segmentsis accessed. For example, the mobile apparatus 20 may access mapinformation/data from a geographic database storing map information/dataof the mobile version of the digital map from memory 24.

In various embodiments, the cost value assigned to a segment isdetermined based on whether the segment satisfies the bloom filter. Forexample, if a coded map version agnostic identifier corresponding to afirst segment satisfies the bloom filter, the first segment is assigneda minimal cost value. For example, the first segment may be assigned acost value of zero. However, if the coded map version agnosticidentifier corresponding to the first segment does not satisfy the bloomfilter, the first segment is assigned a positive cost value (e.g., basedon the length of the segment, expected time of traversal for thesegment, a current or expected traffic level for the segment, theprobability of finding parking along the segment, and/or the like).Thus, map information/data for generating map version agnosticidentifiers for segments may be accessed from the mobile version of thedigital map for use in determining whether a segment satisfies the bloomfilter. For example, a segment record corresponding to a segment may beaccessed and map version agnostic information/data may be extractedtherefrom. In an example embodiment, elements of the segment record tobe accessed for generating a map version agnostic identifier for thesegment are pre-established and/or defined. In particular, the elementsof the segment record to be accessed for use in generating a map versionagnostic identifier are the same elements of the network version of thedigital map used by the network apparatus to generate the map versionagnostic identifiers that were coded to produce the bloom filter. Forexample, the map version agnostic identifier may be generated using amap version agnostic identifier algorithm and the mobile apparatus 20and the network apparatus 10 may use the same map version agnosticidentifier algorithm. For example, the map version agnostic identifiermay be generated using a map version agnostic identifier algorithm andthe mobile apparatus 20 and the network apparatus 10 may use the samemap version agnostic identifier algorithm. For example, the map versionagnostic map information/data accessed may include a road name, segmentlength, a direction of travel of a segment, a functional class of asegment, speed limit, segment midpoint, and/or the like, in variousembodiments.

The map version agnostic map information/data corresponding to a segmentmay then be used to generate a map version agnostic identifier for thesegment. For example, the accessed map version agnostic information/datacorresponding to a segment may be combined in a pre-established and/ordefined manner (e.g., in the same manner as the generation of the mapversion agnostic identifiers where generated by the network apparatus10) to generate a map version agnostic identifier configured to identifythe segment. The map version agnostic identifier may then be used todetermine if the corresponding segment satisfies the bloom filter. Ifthe segment satisfies the bloom filter, the segment is assigned aminimal (e.g., zero) cost value. If the segment does not satisfy thebloom filter, the segment may be assigned a cost value based on mapinformation/data (e.g., length of the segment, probability of finding(on-road) parking along the segment during an epoch corresponding to theparking time, travel speed along the segment during an epochcorresponding to the parking time, and/or the like). In an exampleembodiment, the cost value assigned to a segment may be the length ofthe segment divided by the travel speed along the segment during anepoch corresponding to the parking time (e.g.,

/v_(t)). In an example embodiment, the cost value assigned to a segmentmay be the length of the segment divided by the travel speed along thesegment during an epoch corresponding to the parking time and multipliedby one minus the probability of finding (on-road) parking along thesegment during the epoch corresponding to the parking time

$\left( {{e.g.},{\frac{\ell}{v_{t}}*\left( {1 - P} \right)}} \right).$

In an example embodiment, blocks 1608 and 1610 may be performedconcurrently with block 1612 such that the traffic, parking, and/or mapinformation/data for generating a map version agnostic identifier andassigning a cost value to a first segment is accessed when a routedetermining algorithm is expanded to the first segment. For example,traffic, parking, and/or map information/data for assigning a cost valueto a first segment (e.g., including the map version agnosticinformation/data used to generate a map version agnostic identifier foruse in determining if the first segment satisfies the bloom filter) maybe accessed and the cost value assigned to the first segment basedthereon, in response to a route determining algorithm consideringwhether the first segment is part of the decoded route.

At block 1612, a decoded route is determined by identifying the lowestcost route from the decoded starting segment to the decoded targetsegment is determined. For example, the mobile apparatus 20 maydetermine a decoded route by determining the lowest cost route from thedecoded starting segment to the decoded target segment. For example, themobile apparatus 20 may comprise means, such as processor 22, memory 24,and/or the like, for determining a decoded route by determining thelowest cost route from the decoded starting segment to the decodedtarget segment. For example, the lowest cost route may be determinedbased on the cost value assigned to segments between the decodedstarting segment and the decoded target segment. In various embodiments,a best-first algorithm may be used to determine the decoded route. In anexample embodiment, a version of Dijkstra's algorithm or another costminimization algorithm may be used to determine the decoded route.

At block 1614, it is determined if the decoded route satisfies one ormore quality measures. In an example embodiment, the one or more qualitymeasures comprise the length of the decoded route being similar to theroute length provided as part of the route response. For example, adecoded route length may be determined and compared to the route lengthprovided by the route response. In an example embodiment, the decodedroute length is determined by summing the length of each segment in thedecoded route based on the mobile version of the digital map. Forexample, it may be determined if the decoded route length and the routelength satisfy a similarity threshold requirement. In an exampleembodiment, the ratio of the decoded route length and the route lengthmay be compared to a similarity range to determine if the decoded routelength and the route length satisfy a similarity threshold requirement.For example, if the ratio of the decoded route length to the routelength is within the similarity range, it may be determined that thedecoded route is an acceptable route. If the ratio of the decoded routelength to the route length is not within the similarity range, it may bedetermined that the decoded route is not an acceptable route. In variousembodiments, the similarity range is a predetermined range. In someexample embodiments, the similarity range is 0.7 to 1.3, 0.75 to 1.25,0.8 to 1.2, 0.85 to 1.15, 0.9 to 1.1, and/or 0.95 to 1.05. For example,the mobile apparatus 20 may determine if the decoded route length andthe route length satisfy a similarity threshold requirement. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, and/or the like, for determining if the decoded routelength and the route length satisfy the similarity thresholdrequirement.

In an example embodiment, the one or more quality measures may includedetermining whether the number of elements in the bloom filter that themobile apparatus 20 cannot resolve satisfies a quality thresholdrequirement. When the number of elements of the bloom filter that cannotbe resolved by the mobile apparatus 20 fails to satisfy a qualitythreshold requirement (e.g., exceeds a quality threshold number), it maybe determined that the decoded route fails to satisfy a quality measure.

When it is determined that the decoded route satisfies the one or morequality measures (e.g., the decoded route length and the route lengthsatisfy the similarity threshold requirement), the process continues toblock 1616 and the route is accepted. For example, the mobile apparatus20 may accept the route and use the route to complete one or morenavigation functions. For example, the mobile apparatus 20 may comprisemeans, such as processor 22, memory 24, communications interface 26,user interface 28, sensors 29, and/or the like, for (responsive todetermining that the decoded route satisfies the one or more qualitymeasures) accepting the decoded route and using the decoded route toperform one or more navigation functions. Some non-limiting examples ofnavigation functions include providing a route (e.g., via a userinterface), localization, route determination, lane level routedetermination, operating a vehicle along a lane level route, routetravel time determination, lane maintenance, route guidance, lane levelroute guidance, provision of traffic information/data, provision of lanelevel traffic information/data, vehicle trajectory determination and/orguidance, vehicle speed and/or handling control, route and/or maneuvervisualization, and/or the like. For example, the mobile apparatus 20 mayprovide the decoded route to a user such that the user may control thevehicle along at least a portion of the decoded route in search ofparking. In an example embodiment, when the mobile apparatus 20determines that the vehicle 5 is traversing the decoded route, themobile apparatus 20 may cause one or more sensors 29 of the vehicle 5 tooperate in a parking mode to automatically identify available parkingspaces along the decoded route and provide a user perceivable alert whenan available parking space is identified. For example, the mobileapparatus 20 may control the vehicle 5 in a parking cruise mode totraverse at least a portion of the decoded route in search of parkingand may (automatically) park the vehicle 5 in an (automatically)identified parking space. In an example embodiment, when the vehicle 5is parked, the mobile apparatus 20 may provide a communication such thatthe communication is received by the network apparatus 10 indicating thelocation where parking was found such that the network apparatus 10 maymaintain updated parking information/data.

When it is determined that the decoded route does not satisfy at leastone quality measure (e.g., the decoded route length and the route lengthdo not satisfy the similarity threshold requirement), the processcontinues to block 1618. At block 1618, the route is rejected and a newparking cruise route is requested. For example, the mobile apparatus 20may reject the route and request a new parking cruise route. Forexample, the mobile apparatus 20 may comprise means, such as processor22, memory 24, communications interface 26, and/or the like for(responsive to determining that the decoded route fails to satisfy atlast one quality measure) rejecting the route and requesting a newparking cruise route. For example, the mobile apparatus 20 may generatean updated and/or modified parking cruise request and provide (e.g.,transmit) the updated and/or modified parking cruise request such thatthe network apparatus 10 receives the updated and/or modified parkingcruise request. In response to the updated and/or modified parkingcruise request, the network apparatus 10 may generate a new parkingcruise route, encode a route segment set defined by the same or the newparking cruise route with a larger bloom filter (e.g., a bit arrayhaving more bits than the previously provided bloom filter) and/or thelike. The network apparatus 10 may then provide an updated and/ormodified parking cruise route response comprising a route segment setdefined by the new parking cruise route encoded as a bloom filter, aroute segment set defined by the previous parking cruise route encodedwith a larger bloom filter, and/or the like. The mobile apparatus 20receives the updated and/or modified parking cruise route response anddetermines an updated and/or modified decoded route. In an exampleembodiment, the mobile apparatus 20 determines if the updated and/ormodified decoded route satisfies one or more quality measures todetermine if the updated and/or modified decoded route is to be acceptedor rejected and a new parking cruise route is to be requested.

F. Technical Advantages

Various embodiments provide for the encoding and decoding of a routesegment set defined by a route in a map version agnostic manner. Variousembodiments provide for the transmission of an encoded route segment setin a bandwidth efficient manner. For example, various embodimentsprovide for encoding a route segment set using map version agnosticidentifiers that are encoded into a bloom filter, such that the encodedroute segment set may be transmitted as a bit array. In variousembodiments, the encoding may be performed such that the resulting bloomfilter is the smallest bloom filter that is satisfied by route segmentsof the route segment set being encoded (e.g., the members of the bloomfilter are coded map version agnostic identifiers configured to identifythe route segments of the route segment set being encoded) and that isnot satisfied by adjacent segments of the route (e.g., coded map versionagnostic identifiers configured to identify adjacent segments are notmembers of the route segment set). As used herein, an adjacent segmentis a segment that intersections a route, but that is not part of theroute. Moreover, as the segment identifiers that are coded to generatethe coded route segment identifiers are map version agnostic, thenetwork version of the digital map stored by the network apparatus 10and the mobile version of the digital map stored by the mobile apparatus20 may be different versions of the digital map. Additionally, the useof a cost minimization algorithm by the mobile apparatus to determine adecoded route, wherein segments that satisfy the bloom filter areassigned a minimal cost, allows the mobile apparatus to automatically“heal” any issues in decoding the route due to differences in the mobileversion and the network version of the digital map. Thus, variousembodiments provide an efficient self-healing decoding of routes by amobile apparatus.

Moreover, the determination of the decoded route by the mobile apparatususing a bloom filter is considerably more efficient than determining adecoded route based on comparing spatial/physical link similaritiesbetween links. Indeed, the determination of the decoded route using abloom filter does not involve map-matching beyond the identification ofthe decoded start segment and the decoded target segment or the use ofhigher geometrical functions. Rather, determination of the decoded routeusing the bloom filter, as described herein, comprises the use ofBoolean comparisons (e.g., equal or not equal) at a data level. Forexample, the mobile apparatus may determine if a particular segmentsatisfies a bloom filter via a Boolean comparison.

Various embodiments of the present invention therefore provide technicalsolutions to the technical problems of the bandwidth efficientcommunication of routes between apparatuses that have access todifferent versions of a digital map.

III. Example Apparatus

The network apparatus 10 and/or mobile apparatus 20 of an exampleembodiment may be embodied by or associated with a variety of computingdevices including, for example, a navigation system including anin-vehicle navigation system, a vehicle control system, a personalnavigation device (PND) or a portable navigation device, an advanceddriver assistance system (ADAS), a global navigation satellite system(GNSS), a cellular telephone, a mobile phone, a personal digitalassistant (PDA), a watch, a camera, a computer, and/or other device thatcan perform navigation-related functions, such as digital routing andmap display. Additionally or alternatively, the network apparatus 10and/or mobile apparatus 20 may be embodied in other types of computingdevices, such as a server, a personal computer, a computer workstation,a laptop computer, a plurality of networked computing devices or thelike, that are configured to update one or more map tiles, analyze probepoints for route planning or other purposes, store and/or providedriving condition information/data, generate and provide sensor qualityindex tables and/or driving condition tables, and/or the like. In anexample embodiment, a mobile apparatus 20 is an in-vehicle navigationsystem onboard a vehicle 5 or a mobile device and a network apparatus 10is a server. In an example embodiment, a mobile apparatus 20 is anapparatus configured to provide a user with a route (e.g., via userinterface 28) and/or control a vehicle 5 to traverse a route. In thisregard, FIG. 2A depicts an example network apparatus 10 and FIG. 2Bdepicts an example mobile apparatus 20 that may be embodied by variouscomputing devices including those identified above. As shown, thenetwork apparatus 10 of an example embodiment may include, may beassociated with, or may otherwise be in communication with a processor12 and a memory device 14 and optionally a communication interface 16and/or a user interface 18. Similarly, a mobile apparatus 20 of anexample embodiment may include, may be associated with, or may otherwisebe in communication with a processor 22 and a memory device 24 andoptionally a communication interface 26, a user interface 28, one ormore sensors 29 (e.g., a location sensor such as a GNSS sensor, IMUsensors, and/or the like; camera(s); 2D and/or 3D LiDAR(s); long,medium, and/or short range RADAR; ultrasonic sensors; electromagneticsensors; (near-)IR cameras, 3D cameras, 360° cameras; and/or othersensors that enable the mobile apparatus to determine a location ofmobile apparatus and/or determine one or more features of thecorresponding vehicle's 5 surroundings), and/or other componentsconfigured to perform various operations, procedures, functions, or thelike described herein. In various embodiments, the one or more sensors29 are onboard the same vehicle 5 as the mobile apparatus 20.

In some embodiments, the processor 12, 22 (and/or co-processors or anyother processing circuitry assisting or otherwise associated with theprocessor) may be in communication with the memory device 14, 24 via abus for passing information among components of the apparatus. Thememory device may be non-transitory and may include, for example, one ormore volatile and/or non-volatile memories. In other words, for example,the memory device may be an electronic storage device (e.g., anon-transitory computer readable storage medium) comprising gatesconfigured to store data (e.g., bits) that may be retrievable by amachine (e.g., a computing device like the processor). The memory devicemay be configured to store information, data, content, applications,instructions, or the like for enabling the apparatus to carry outvarious functions in accordance with an example embodiment of thepresent invention. For example, the memory device could be configured tobuffer input data for processing by the processor. Additionally oralternatively, the memory device could be configured to storeinstructions for execution by the processor.

As described above, the network apparatus 10 and/or probe apparatus 20may be embodied by a computing device. However, in some embodiments, theapparatus may be embodied as a chip or chip set. In other words, theapparatus may comprise one or more physical packages (e.g., chips)including materials, components and/or wires on a structural assembly(e.g., a baseboard). The structural assembly may provide physicalstrength, conservation of size, and/or limitation of electricalinteraction for component circuitry included thereon. The apparatus maytherefore, in some cases, be configured to implement an embodiment ofthe present invention on a single chip or as a single “system on achip.” As such, in some cases, a chip or chipset may constitute meansfor performing one or more operations for providing the functionalitiesdescribed herein.

The processor 12, 22 may be embodied in a number of different ways. Forexample, the processor 12, 22 may be embodied as one or more of varioushardware processing means such as a coprocessor, a microprocessor, acontroller, a digital signal processor (DSP), a processing element withor without an accompanying DSP, or various other processing circuitryincluding integrated circuits such as, for example, an ASIC (applicationspecific integrated circuit), an FPGA (field programmable gate array), amicrocontroller unit (MCU), a hardware accelerator, a special-purposecomputer chip, or the like. As such, in some embodiments, the processor12, 22 may include one or more processing cores configured to performindependently. A multi-core processor may enable multiprocessing withina single physical package. Additionally or alternatively, the processor12, 22 may include one or more processors configured in tandem via thebus to enable independent execution of instructions, pipelining and/ormultithreading.

In an example embodiment, the processor 12, 22 may be configured toexecute instructions stored in the memory device 14, 24 or otherwiseaccessible to the processor. Alternatively or additionally, theprocessor may be configured to execute hard coded functionality. Assuch, whether configured by hardware or software methods, or by acombination thereof, the processor may represent an entity (e.g.,physically embodied in circuitry) capable of performing operationsaccording to an embodiment of the present invention while configuredaccordingly. Thus, for example, when the processor is embodied as anASIC, FPGA or the like, the processor may be specifically configuredhardware for conducting the operations described herein. Alternatively,as another example, when the processor is embodied as an executor ofsoftware instructions, the instructions may specifically configure theprocessor to perform the algorithms and/or operations described hereinwhen the instructions are executed. However, in some cases, theprocessor may be a processor of a specific device (e.g., a pass-throughdisplay or a mobile terminal) configured to employ an embodiment of thepresent invention by further configuration of the processor byinstructions for performing the algorithms and/or operations describedherein. The processor may include, among other things, a clock, anarithmetic logic unit (ALU) and logic gates configured to supportoperation of the processor.

In some embodiments, the network apparatus 10 and/or mobile apparatus 20may include a user interface 18, 28 that may, in turn, be incommunication with the processor 12, 22 to provide output to the user,such as one or more routes through a road network, one or morenotifications regarding traffic conditions along at least a portion of aroute, and/or the output of one or more other navigation functions, and,in some embodiments, to receive an indication of a user input. As such,the user interface may include one or more output devices such as adisplay, speaker, and/or the like and, in some embodiments, may alsoinclude one or more input devices such as a keyboard, a mouse, ajoystick, a touch screen, touch areas, soft keys, a microphone, aspeaker, or other input/output mechanisms. Alternatively oradditionally, the processor may comprise user interface circuitryconfigured to control at least some functions of one or more userinterface elements such as a display and, in some embodiments, aspeaker, ringer, microphone and/or the like. The processor and/or userinterface circuitry comprising the processor may be configured tocontrol one or more functions of one or more user interface elementsthrough computer program instructions (e.g., software and/or firmware)stored on a memory accessible to the processor 12, 22 (e.g., memorydevice 14, 24 and/or the like).

The network apparatus 10 and/or mobile apparatus 20 may optionallyinclude a communication interface 16, 26. The communication interface16, 26 may be any means such as a device or circuitry embodied in eitherhardware or a combination of hardware and software that is configured toreceive and/or transmit data from/to a network and/or any other deviceor module in communication with the apparatus. In this regard, thecommunication interface may include, for example, an antenna (ormultiple antennas) and supporting hardware and/or software for enablingcommunications with a wireless communication network. Additionally oralternatively, the communication interface may include the circuitry forinteracting with the antenna(s) to cause transmission of signals via theantenna(s) or to handle receipt of signals received via the antenna(s).In some environments, the communication interface may alternatively oralso support wired communication. As such, for example, thecommunication interface may include a communication modem and/or otherhardware/software for supporting communication via cable, digitalsubscriber line (DSL), universal serial bus (USB) or other mechanisms.

In addition to embodying the network apparatus 10 and/or mobileapparatus 20 of an example embodiment, a navigation system may alsoinclude or have access to a geographic database. For example, in variousembodiments, a network apparatus 10 and/or mobile apparatus 20 maycomprise a component (e.g., memory 14, 24, and/or another component)that stores a digital map (e.g., in the form of a geographic database)comprising a first plurality of data records, each of the firstplurality of data records representing a corresponding TME, wherein atleast some of said first plurality of data records map information/data(e.g., the updated map information/data) indicating current trafficconditions along the corresponding TME. For example, the geographicdatabase may include a variety of data (e.g., map information/data)utilized in various navigation functions such as constructing a route ornavigation path, determining the time to traverse the route ornavigation path, matching a geolocation (e.g., a GNSS determinedlocation) to a point on a map, a lane of a lane network, and/or link,one or more localization features and a corresponding location of eachlocalization feature, and/or the like. For example, a geographicdatabase may include road segment, segment, link, or traversable mapelement (TME) data records, point of interest (POI) data records,localization feature data records, and other data records. More, feweror different data records can be provided. In one embodiment, the otherdata records include cartographic (“carto”) data records, routing data,and maneuver data. One or more portions, components, areas, layers,features, text, and/or symbols of the POI or event data can be storedin, linked to, and/or associated with one or more of these data records.For example, one or more portions of the POI, event data, or recordedroute information can be matched with respective map or geographicrecords via position or GNSS data associations (such as using known orfuture map matching or geo-coding techniques), for example. In anexample embodiment, the data records may comprise nodes, connectioninformation/data, intersection data records, link data records, POI datarecords, and/or other data records. In an example embodiment, thenetwork apparatus 10 may be configured to modify, update, and/or thelike one or more data records of the geographic database. For example,the network apparatus 10 may modify, update, generate, and/or the likemap information/data corresponding to TMEs, links, lanes, road segments,travel lanes of road segments, nodes, intersection, and/or the likeand/or the corresponding data records (e.g., to add or update updatedmap information/data including, for example, current traffic conditionsalong a corresponding TME), a localization layer (e.g., comprisinglocalization features) and/or the corresponding data records, and/or thelike.

In an example embodiment, the TME data records are links, lanes, orsegments, e.g., maneuvers of a maneuver graph, representing roads,travel lanes of roads, streets, or paths, as can be used in thecalculated route or recorded route information for determination of oneor more personalized routes. The intersection data records are endingpoints corresponding to the respective links or segments of the roadsegment data records. The TME data records and the intersection datarecords represent a road network, such as used by vehicles, cars, and/orother entities. Alternatively, the geographic database can contain pathsegment and intersection data records or nodes and connectioninformation/data or other data that represent pedestrian paths or areasin addition to or instead of the vehicle road record data, for example.

The TMEs, road/link segments, segments, intersections, and/or nodes canbe associated with attributes, such as geographic coordinates, streetnames, address ranges, speed limits, turn restrictions at intersections,and other navigation related attributes, as well as POIs, such asgasoline stations, hotels, restaurants, museums, stadiums, offices,automobile dealerships, auto repair shops, buildings, stores, parks,etc. The geographic database can include data about the POIs and theirrespective locations in the POI data records. The geographic databasecan also include data about places, such as cities, towns, or othercommunities, and other geographic features, such as bodies of water,mountain ranges, etc. Such place or feature data can be part of the POIdata or can be associated with POIs or POI data records (such as a datapoint used for displaying or representing a position of a city). Inaddition, the geographic database can include and/or be associated withevent data (e.g., traffic incidents, constructions, scheduled events,unscheduled events, etc.) associated with the POI data records or otherrecords of the geographic database.

The geographic database can be maintained by the content provider (e.g.,a map developer) in association with the services platform. By way ofexample, the map developer can collect geographic data to generate andenhance the geographic database. There can be different ways used by themap developer to collect data. These ways can include obtaining datafrom other sources, such as municipalities or respective geographicauthorities. In addition, the map developer can employ field personnelto travel by vehicle along roads throughout the geographic region toobserve features and/or record information about them, for example.Also, remote sensing, such as aerial or satellite photography, can beused.

The geographic database can be a master geographic database stored in aformat that facilitates updating, maintenance, and development. Forexample, the master geographic database or data in the master geographicdatabase can be in an Oracle spatial format or other spatial format,such as for development or production purposes. The Oracle spatialformat or development/production database can be compiled into adelivery format, such as a geographic data files (GDF) format. The datain the production and/or delivery formats can be compiled or furthercompiled to form geographic database products or databases, which can beused in end user navigation devices or systems.

For example, geographic data is compiled (such as into a platformspecification format (PSF) format) to organize and/or configure the datafor performing navigation-related functions and/or services, such asroute calculation, route guidance, map display, speed calculation,distance and travel time functions, and other functions. Thenavigation-related functions can correspond to vehicle navigation orother types of navigation. The compilation to produce the end userdatabases can be performed by a party or entity separate from the mapdeveloper. For example, a customer of the map developer, such as anavigation device developer or other end user device developer, canperform compilation on a received geographic database in a deliveryformat to produce one or more compiled navigation databases. Regardlessof the manner in which the databases are compiled and maintained, anavigation system that embodies a network apparatus 10 and/or mobileapparatus 20 in accordance with an example embodiment may determine thetime to traverse a route that includes one or more turns at respectiveintersections more accurately.

IV. Apparatus, Methods, and Computer Program Products

As described above, FIGS. 3, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16illustrate flowcharts of a network apparatus 10 and/or mobile apparatus20, methods, and computer program products according to an exampleembodiment of the invention. It will be understood that each block ofthe flowcharts, and combinations of blocks in the flowcharts, may beimplemented by various means, such as hardware, firmware, processor,circuitry, and/or other devices associated with execution of softwareincluding one or more computer program instructions. For example, one ormore of the procedures described above may be embodied by computerprogram instructions. In this regard, the computer program instructionswhich embody the procedures described above may be stored by the memorydevice 14, 24 of an apparatus employing an embodiment of the presentinvention and executed by the processor 12, 22 of the apparatus. As willbe appreciated, any such computer program instructions may be loadedonto a computer or other programmable apparatus (e.g., hardware) toproduce a machine, such that the resulting computer or otherprogrammable apparatus implements the functions specified in theflowchart blocks. These computer program instructions may also be storedin a computer-readable memory that may direct a computer or otherprogrammable apparatus to function in a particular manner, such that theinstructions stored in the computer-readable memory produce an articleof manufacture the execution of which implements the function specifiedin the flowchart blocks. The computer program instructions may also beloaded onto a computer or other programmable apparatus to cause a seriesof operations to be performed on the computer or other programmableapparatus to produce a computer-implemented process such that theinstructions which execute on the computer or other programmableapparatus provide operations for implementing the functions specified inthe flowchart blocks.

Accordingly, blocks of the flowcharts support combinations of means forperforming the specified functions and combinations of operations forperforming the specified functions for performing the specifiedfunctions. It will also be understood that one or more blocks of theflowcharts, and combinations of blocks in the flowcharts, can beimplemented by special purpose hardware-based computer systems whichperform the specified functions, or combinations of special purposehardware and computer instructions.

In some embodiments, certain ones of the operations above may bemodified or further amplified. Furthermore, in some embodiments,additional optional operations may be included. Modifications,additions, or amplifications to the operations above may be performed inany order and in any combination.

Many modifications and other embodiments of the inventions set forthherein will come to mind to one skilled in the art to which theseinventions pertain having the benefit of the teachings presented in theforegoing descriptions and the associated drawings. Therefore, it is tobe understood that the inventions are not to be limited to the specificembodiments disclosed and that modifications and other embodiments areintended to be included within the scope of the appended claims.Moreover, although the foregoing descriptions and the associateddrawings describe example embodiments in the context of certain examplecombinations of elements and/or functions, it should be appreciated thatdifferent combinations of elements and/or functions may be provided byalternative embodiments without departing from the scope of the appendedclaims. In this regard, for example, different combinations of elementsand/or functions than those explicitly described above are alsocontemplated as may be set forth in some of the appended claims.Although specific terms are employed herein, they are used in a genericand descriptive sense only and not for purposes of limitation.

That which is claimed:
 1. A method comprising: receiving a routeresponse provided by a network apparatus, the route response comprisinginformation identifying a starting location and a target location of aroute and a bloom filter encoding a route segment set defined by theroute, the route response received by a mobile apparatus comprising aprocessor, a communication interface, and a memory storing a mobileversion of a digital map; using the information identifying the startinglocation and the target location to identify a decoded starting segmentof the mobile version of the digital map for the route and a decodedtarget segment of the mobile version of the digital map for the route;accessing map information for determining a cost value for segments ofthe digital map; determining whether a first segment referenced in themap information satisfies the bloom filter; when it is determined thatthe first segment satisfies the bloom filter, assigning a minimal costvalue to the first segment; when it is determined that the first segmentdoes not satisfy the bloom filter, assigning a cost value to the firstsegment determined based at least in part on the map informationcorresponding to the first segment; determining a decoded route from thedecoded starting segment to the decoded target segment based on the costvalue assigned to the segments using a cost minimization routedetermination algorithm; and at least one of (a) providing the decodedroute via a user interface of the mobile apparatus or (b) controlling avehicle such that the vehicle traverses the decoded route.
 2. The methodof claim 1, wherein the cost value assigned to a segment that does notsatisfy the bloom filter is determined based on at least one of a lengthof the segment or an expected time to traverse the segment.
 3. Themethod of claim 1, wherein the cost minimization route determinationalgorithm is a Dijkstra's algorithm.
 4. The method of claim 1, whereinthe information identifying the starting location and the targetlocation of a route comprises a geolocation of a point along a networkversion starting segment corresponding to an origin of the route and theinformation identifying the target location is a geolocation of a pointalong a network version target segment corresponding to a destination ofthe route.
 5. The method of claim 1, further comprising determiningwhether the decoded route satisfies at least one quality measure,wherein when the decoded route satisfies the at least one qualitymeasure, the decoded route is provided or used to control the vehicleand when the decoded route does not satisfy the at least one qualitymeasure, a modified route is requested.
 6. The method of claim 5,wherein determining whether the decoded route satisfies at least onequality measure comprises: determining a length of the decoded route;and determining whether the length of the decoded route and a routelength provided in the route response satisfy a similarity measure,wherein when the length of the decoded route and the route lengthsatisfy the similarity measure, the decoded route is determined tosatisfy the least one quality measure and when the length of the decodedroute and the route length do not satisfy the similarity measure, thedecoded route is determined to not satisfy the least one qualitymeasure.
 7. The method of claim 1, wherein the route response comprisesa plurality of bloom filters and a waypoint list, each of the pluralityof bloom filters corresponding to a leg of the route and the waypointlist provides information identifying a beginning segment and an endingsegment for each leg of the route, and determining the decoded routecomprises determining a decoded route for each leg, each legcorresponding to one of the plurality of bloom filters in the orderindicated by the waypoint list.
 8. The method of claim 1, furthercomprising, prior to receiving the route response, generating andproviding a route request, wherein the route request comprises mapversion agnostic information identifying a starting location for theroute and map version agnostic information identifying a target locationfor the route.
 9. The method of claim 8, wherein the starting locationis determined based on location information received from a locationsensor in communication with the processor.
 10. An apparatus comprisingat least one processor, a communications interface configured forcommunicating via at least one network, and at least one memory storingcomputer program code and a mobile version of a digital map, the atleast one memory and the computer program code configured to, with theprocessor, cause the apparatus to at least: receive a route responseprovided by a network apparatus, the route response comprisinginformation identifying a starting location and a target location of aroute and a bloom filter encoding a route segment set defined by theroute; use the information identifying the starting location and thetarget location to identify a decoded starting segment of the mobileversion of the digital map for the route and a decoded target segment ofthe mobile version of the digital map for the route; access mapinformation for determining a cost value for segments of the digitalmap; determine whether a first segment referenced in the map informationsatisfies the bloom filter; when it is determined that the first segmentsatisfies the bloom filter, assign a minimal cost value to the firstsegment; when it is determined that the first segment does not satisfythe bloom filter, assign a cost value to the first segment determinedbased at least in part on the map information corresponding to the firstsegment; determine a decoded route from the decoded starting segment tothe decoded target segment based on the cost value assigned to thesegments using a cost minimization route determination algorithm; and atleast one of (a) provide the decoded route via a user interface of theapparatus or (b) control a vehicle such that the vehicle traverses thedecoded route.
 11. The apparatus of claim 10, wherein the cost valueassigned to a segment that does not satisfy the bloom filter isdetermined based on at least one of a length of the segment or anexpected time to traverse the segment.
 12. The apparatus of claim 10,wherein the cost minimization route determination algorithm is aDijkstra's algorithm.
 13. The apparatus of claim 10, wherein theinformation identifying the starting location and the target location ofa route comprises a geolocation of a point along a network versionstarting segment corresponding to an origin of the route and theinformation identifying the target location is a geolocation of a pointalong a network version target segment corresponding to a destination ofthe route.
 14. The apparatus of claim 10, wherein the at least onememory and the computer program code are further configured to, with theprocessor, cause the apparatus to at least determine whether the decodedroute satisfies at least one quality measure, wherein when the decodedroute satisfies the at least one quality measure, the decoded route isprovided or used to control the vehicle and when the decoded route doesnot satisfy the at least one quality measure, a modified route isrequested.
 15. The apparatus of claim 14, wherein determining whetherthe decoded route satisfies at least one quality measure comprises:determining a length of the decoded route; and determining whether thelength of the decoded route and a route length provided in the routeresponse satisfy a similarity measure, wherein when the length of thedecoded route and the route length satisfy the similarity measure, thedecoded route is determined to satisfy the least one quality measure andwhen the length of the decoded route and the route length do not satisfythe similarity measure, the decoded route is determined to not satisfythe least one quality measure.
 16. The apparatus of claim 10, whereinthe route response comprises a plurality of bloom filters and a waypointlist, each of the plurality of bloom filters corresponding to a leg ofthe route and the waypoint list provides information identifying abeginning segment and an ending segment for each leg of the route, anddetermining the decoded route comprises determining a decoded route foreach leg, each leg corresponding to one of the plurality of bloomfilters in the order indicated by the waypoint list.
 17. The apparatusof claim 10, wherein the at least one memory and the computer programcode are further configured to, with the processor, cause the apparatusto at least, prior to receiving the route response, generate and providea route request, wherein the route request comprises map versionagnostic information identifying a starting location for the route andmap version agnostic information identifying a target location for theroute.
 18. The apparatus of claim 17, wherein the starting location isdetermined based on location information received from a location sensorin communication with the processor.
 19. A computer program productcomprising at least one non-transitory computer-readable storage mediumhaving computer-readable program code portions stored therein, thecomputer-readable program code portions comprising executable portionsconfigured, when executed by a processor of an apparatus, to cause theapparatus to: receive a route response provided by a network apparatus,the route response comprising information identifying a startinglocation and a target location of a route and a bloom filter encoding aroute segment set defined by the route; use the information identifyingthe starting location and the target location to identify a decodedstarting segment of the mobile version of the digital map for the routeand a decoded target segment of the mobile version of the digital mapfor the route; access map information for determining a cost value forsegments of the digital map; determining whether a first segmentreferenced in the map information satisfies the bloom filter; when it isdetermined that the first segment satisfies the bloom filter, assigninga minimal cost value to the first segment; when it is determined thatthe first segment does not satisfy the bloom filter, assigning a costvalue to the first segment determined based at least in part on the mapinformation corresponding to the first segment; determine a decodedroute from the decoded starting segment to the decoded target segmentbased on the cost value assigned to the segments using a costminimization route determination algorithm; and at least one of (a)provide the decoded route via a user interface of the apparatus or (b)control a vehicle such that the vehicle traverses the decoded route. 20.The computer program product of claim 19, wherein the cost valueassigned to a segment that does not satisfy the bloom filter isdetermined based on at least one of a length of the segment or anexpected time to traverse the segment.